id:A023506 - OEIS Search Results

Search: id:A023506

Displaying 1-1 of 1 results found.

page 1

Exponent of 2 in prime factorization of prime(n) - 1.

+0
7

0, 1, 2, 1, 1, 2, 4, 1, 1, 2, 1, 2, 3, 1, 1, 2, 1, 2, 1, 1, 3, 1, 1, 3, 5, 2, 1, 1, 2, 4, 1, 1, 3, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 6, 2, 1, 1, 1, 1, 2, 3, 1, 4, 1, 8, 1, 2, 1, 2, 3, 1, 2, 1, 1, 3, 2, 1, 4, 1, 2, 5, 1, 1, 2, 1, 1, 2, 2, 4, 3, 1, 2, 1, 4, 1, 1, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 2, 1, 2, 1, 3, 1 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Also the number of steps to reach an integer starting with prime(n)/2 and iterating the map x->x*ceiling(x). - Benoit Cloitre, Sep 06, 2002.` `Also exponent of 2 in -1+p[n]^s for s=odd exponents because (-1+p[n]^s)/(p[n]-1) is odd. - Labos E. (labos(AT)ana.sote.hu), Jan 20 2004`
	FORMULA	`a(n) = A007814[A000010[A000040(n)]] = A007814[A006093(n)]`
	EXAMPLE	`n=25, p(25)=97, A006093(25)=96=2.2.2.2.2.3, so a(25)=5.`
	CROSSREFS	`Cf. A007814, A000010, A000040, A006093.` `Sequence in context: A077971 A030018 A010739 this_sequence A140995 A140994 A140993` `Adjacent sequences: A023503 A023504 A023505 this_sequence A023507 A023508 A023509`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research