|
| |
|
|
A306600
|
|
In base 8, records for the number of 'Reverse and Add' steps needed to reach a palindrome.
|
|
3
|
|
|
|
0, 1, 2, 3, 6, 14, 17, 19, 21, 22, 23, 29, 30, 36, 46, 59, 60, 64, 67, 94, 95, 97, 120, 122, 133, 164
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
It is conjectured that if a Reverse and Add! trajectory reaches a palindrome, it will be reached in relatively few steps, or otherwise it will never reach a palindrome.
For all n, all numbers m < A306599(n) will reach a palindrome within a(n) Reverse and Add! steps, or otherwise it is conjectured never to reach a palindrome.
|
|
|
LINKS
|
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,base,more
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
