id:A088601 - OEIS Search Results

Search: id:A088601

Displaying 1-1 of 1 results found.

page 1

Let f(k) = k - (the largest palindrome less than k); a(n) = number of steps to reach 0 when iterating f, starting at n.

+0
2

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 1, 2, 2, 2, 2 (list; graph; listen)

	OFFSET	`1,10`
	EXAMPLE	`a(10) = 2: f(10) = 10-9 = 1, f(1) = 1-1 = 0, two steps.`
	CROSSREFS	`A109326 gives index of first occurrence of n in this sequence.` `Sequence in context: A043542 A043568 A043543 this_sequence A028950 A094916 A036485` `Adjacent sequences: A088598 A088599 A088600 this_sequence A088602 A088603 A088604`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 13 2003`
	EXTENSIONS	`More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 11 2005`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research