id:A118522 - OEIS Search Results

Search: id:A118522

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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

	OFFSET	`1,2`
	COMMENT	`Initial cycles have length 3 or 6.`
	LINKS	`N. J. A. Sloane, Sequences of RADD type`
	CROSSREFS	`For records see A118523, A118524. Cf. A117831. For S_1, S_2 etc. see A118517-A118521.` `Adjacent sequences: A118519 A118520 A118521 this_sequence A118523 A118524 A118525` `Sequence in context: A104548 A085707 A010607 this_sequence A098316 A084055 A084103`
	KEYWORD	`nonn`
	AUTHOR	`njas, May 06 2006`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research