id:A051194 - OEIS Search Results

Search: id:A051194

Displaying 1-1 of 1 results found.

page 1

Triangular array T read by rows: T(n,k)=number of positive integers that divide both n and k.

+0
2

1, 1, 2, 1, 1, 2, 1, 2, 1, 3, 1, 1, 1, 1, 2, 1, 2, 2, 2, 1, 4, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 2, 1, 4, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 2, 1, 2, 2, 2, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 3, 1, 4, 1, 3, 2, 2, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2 (list; table; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`Rows: {1}; {1,2}; {1,1,2}; ...`
	CROSSREFS	`Sum of numbers in row n matches A000203. Sum of numbers in first n rows matches A024916.` `Sequence in context: A029396 A084746 A128259 this_sequence A134838 A049843 A131374` `Adjacent sequences: A051191 A051192 A051193 this_sequence A051195 A051196 A051197`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research