id:A118511 - OEIS Search Results

Search: id:A118511

Displaying 1-1 of 1 results found.

page 1

Define sequence S_n by: initial term = n, reverse digits and add 1 to get next term. It is conjectured that S_n always reaches a cycle of length 9, as in A117230. Sequence gives number of steps for S_n to reach the cycle.

+0
3

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

	OFFSET	`1,11`
	LINKS	`N. J. A. Sloane, Sequences of RADD type`
	CROSSREFS	`For records see A118510. Cf. A117831. S_1 is A117230, S_11 is A118512, S_13 is A118513.` `Sequence in context: A070646 A094381 A074972 this_sequence A022974 A023460 A029926` `Adjacent sequences: A118508 A118509 A118510 this_sequence A118512 A118513 A118514`
	KEYWORD	`nonn,base`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 06 2006`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research