id:A089575 - OEIS Search Results

Search: id:A089575

Displaying 1-1 of 1 results found.

page 1

Let f(k^n) = m where m is the largest power of k+1 < k^n. a(n) = number of iterations of f to reach 1, starting from n and starting from k = 2.

+0
1

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

	OFFSET	`0,3`
	EXAMPLE	`a(5)=4 as f(2^5)=3^3 < 2^5, f(3^3)=4^2 < 3^3, f(4^2)=5 < 4^2 and f(5)=6^0 < 5.`
	CROSSREFS	`Sequence in context: A071475 A112778 A080594 this_sequence A023190 A047783 A057358` `Adjacent sequences: A089572 A089573 A089574 this_sequence A089576 A089577 A089578`
	KEYWORD	`easy,nonn`
	AUTHOR	`Naohiro Nomoto (pcmusume(AT)m11.alpha-net.ne.jp), Dec 29 2003`

page 1

Search completed in 0.002 seconds

Last modified December 5 08:23 EST 2009. Contains 170348 sequences.

AT&T Labs Research