|
Search: id:A072217
|
|
|
| A072217 |
|
Consider the Reverse and Add! problem (cf. A001127); of all the n-digit numbers N which eventually reach a palindrome, pick that number N which takes the greatest number of steps to converge (in case of a tie, pick the smallest N); sequence gives number of steps N takes to converge. |
|
+0
3
|
|
| 2, 24, 23, 21, 55, 64, 96, 96, 98, 109, 149, 149, 188, 186, 201, 197, 236, 232
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Since we do not even know if 196 eventually converges (see A006960, A023108) for n >= 3 these values are only conjectures.
|
|
LINKS
|
Jason Doucette, World records
Index entries for sequences related to Reverse and Add!
|
|
CROSSREFS
|
Cf. A072216, A072218, A001127, A006960, A023108.
Adjacent sequences: A072214 A072215 A072216 this_sequence A072218 A072219 A072220
Sequence in context: A002743 A055535 A132169 this_sequence A052686 A064818 A022374
|
|
KEYWORD
|
nonn,hard,base
|
|
AUTHOR
|
njas, Jul 05 2002
|
|
EXTENSIONS
|
Corrected and extended by Jason Doucette, Mar 29 2005; Oct 09 2005
|
|
|
Search completed in 0.002 seconds
|
