id:A102566 - OEIS Search Results

Search: id:A102566

Displaying 1-1 of 1 results found.

page 1

a(n)={minimal k such that f^k (prime(n))=1} where f(m)=(m+1)/2^r, 2^r is the highest power of two dividing m+1.

+0
1

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

	OFFSET	`1,1`
	COMMENT	`A066195(n+1) is the prime corresponding to the first n in this sequence. - David Wasserman (dwasserm(AT)earthlink.net), Apr 08 2008`
	FORMULA	`a(n) = A023416(prime(n))+1. - David Wasserman (dwasserm(AT)earthlink.net), Apr 08 2008`
	EXAMPLE	`f(f(f(f(17))))=1, prime(7)=17, so a(7)=4`
	CROSSREFS	`Cf. A066195.` `Sequence in context: A049099 A143179 A089610 this_sequence A134156 A067815 A133780` `Adjacent sequences: A102563 A102564 A102565 this_sequence A102567 A102568 A102569`
	KEYWORD	`nonn`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Feb 25 2005`
	EXTENSIONS	`More terms from David Wasserman (dwasserm(AT)earthlink.net), Apr 08 2008`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research