id:A057773 - OEIS Search Results

Search: id:A057773

Displaying 1-1 of 1 results found.

page 1

Sum_{i=1..n} nu_2 ( p(i) - 1), where p(i) is the i-th prime and nu_2(m) = exponent of highest power of 2 dividing m.

+0
2

0, 1, 3, 4, 5, 7, 11, 12, 13, 15, 16, 18, 21, 22, 23, 25, 26, 28, 29, 30, 33, 34, 35, 38, 43, 45, 46, 47, 49, 53, 54, 55, 58, 59, 61, 62, 64, 65, 66, 68, 69, 71, 72, 78, 80, 81, 82, 83, 84, 86, 89, 90, 94, 95, 103, 104, 106, 107, 109, 112, 113, 115, 116, 117, 120, 122, 123 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Exponent of highest power of 2 dividing Euler Phi of primorials.`
	FORMULA	`a(n)=A007814[A000010[A002110(n)]]`
	EXAMPLE	`n=6, 6th primorial is 30030, Phi(30030)=5760=128.9.5, so a(6)=7, exponent of 128.`
	CROSSREFS	`Cf. A007814, A000010, A002110.` `Sequence in context: A022440 A088130 A046840 this_sequence A020486 A091428 A047499` `Adjacent sequences: A057770 A057771 A057772 this_sequence A057774 A057775 A057776`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Nov 02 2000`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research