id:A034973 - OEIS Search Results

Search: id:A034973

Displaying 1-1 of 1 results found.

page 1

Number of prime factors in central binomial coefficients C(n,[ n/2 ]), the terms of A001405.

+0
11

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

	OFFSET	`1,4`
	COMMENT	`Sequence is not monotonic. E.g. a(44)=10,a(45)=9 and a(46)=10. The number of prime factors of n! is pi(n), but these numbers are lower.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	EXAMPLE	`a(25)=a(C(25,12))=a(520030)=6 because actual prime factors are 2,5,7,17,19,23.`
	CROSSREFS	`Cf. A001405, A034974.` `Cf. A067434` `Sequence in context: A053693 A068063 A087181 this_sequence A066927 A060065 A057356` `Adjacent sequences: A034970 A034971 A034972 this_sequence A034974 A034975 A034976`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu)`

page 1

Search completed in 0.002 seconds

Last modified March 19 13:18 EDT 2010. Contains 173632 sequences.

AT&T Labs Research