|
Search: id:A072216
|
|
|
| A072216 |
|
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 values of N. |
|
+0
3
|
|
| 5, 89, 187, 1297, 10911, 150296, 9008299, 15002893, 140669390, 1005499526, 10087799570
(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. A072217, A072218, A001127, A006960, A023108.
Sequence in context: A138700 A139937 A059696 this_sequence A167735 A067257 A134497
Adjacent sequences: A072213 A072214 A072215 this_sequence A072217 A072218 A072219
|
|
KEYWORD
|
nonn,hard,base
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jul 05 2002
|
|
EXTENSIONS
|
Corrected and extended by Jason Doucette, May 20 2003; Oct 09 2005
|
|
|
Search completed in 0.002 seconds
|
