|
|
A326414
|
|
Numbers which require exactly 288 'Reverse and Add' steps to reach a palindrome.
|
|
3
|
|
|
12000700000025339936491, 12000700001015339936491, 12000700002005339936491, 12000700010024339936491, 12000700011014339936491, 12000700012004339936491, 12000700020023339936491, 12000700021013339936491, 12000700022003339936491, 12000700030022339936491
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
Popular Computing (Calabasas, CA), The 196 Problem, Vol. 3 (No. 30, Sep 1975).
|
|
LINKS
|
|
|
FORMULA
|
Each term requires exactly 288 steps to turn into a 142-digit palindrome.
|
|
CROSSREFS
|
Cf. A023109, A033672, A065198, A065199, A065320, A065321, A065322, A065323, A065324, A065325, A065326, A065327, A070743, A072216, A072217, A072218, A281301, A281390, A281506, A281507.
|
|
KEYWORD
|
nonn,base,less
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Deleted an erroneous comment that said that the sequence was finite. - N. J. A. Sloane, Jun 23 2022
|
|
STATUS
|
approved
|
|
|
|