id:A048273 - OEIS Search Results

Search: id:A048273

Displaying 1-1 of 1 results found.

page 1

Maximal number of distinct prime factors in binomial coefficients C(n,k) for k = 0,...,n.

+0
8

0, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 7, 8, 8, 7, 7, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 13, 13, 12, 13, 14, 14, 14, 14, 15, 15, 14, 14, 14, 15, 15, 15, 16, 16, 16, 15, 16, 16 (list; graph; listen)

	OFFSET	`1,4`
	EXAMPLE	`If n=51 and k runs from 0 to 51, then a maximum of 11 distinct prime factors arise, for k=20,21,22,23,28,29,30,31.`
	CROSSREFS	`Cf. A001405, A034973, A001221.` `Adjacent sequences: A048270 A048271 A048272 this_sequence A048274 A048275 A048276` `Sequence in context: A073578 A087866 A061392 this_sequence A024542 A098424 A098428`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research