|
Search: id:A085804
|
|
|
| A085804 |
|
Least k such that n^n + k is a palindrome. |
|
+0
1
|
|
| 0, 0, 6, 6, 98, 8, 885, 545, 4294, 1, 542971, 567942, 4985950, 34463095, 817539359, 3335212865, 1825278551, 60542888969, 351980024812, 6758401, 13316726728064, 355067132000559, 10940544943498235, 100371505302529555, 98630474467606263
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
MATHEMATICA
|
NextPalindrome[n_] := Block[{l = Floor[Log[10, n] + 1], idn = IntegerDigits[n]}, If[ Union[ idn] == {9}, Return[n + 2], If[l < 2, Return[n + 1], If[ FromDigits[ Reverse[ Take[idn, Ceiling[l/2]]]] FromDigits[ Take[idn, -Ceiling[l/2]]], FromDigits[ Join[ Take[idn, Ceiling[l/2]], Reverse[ Take[idn, Floor[l/2]]]]], idfhn = FromDigits[ Take[idn, Ceiling[l/2]]] + 1; idp = FromDigits[ Join[ IntegerDigits[ idfhn], Drop[ Reverse[ IntegerDigits[ idfhn]], Mod[l, 2]]]]]]]]; f[n_] := Block[{}, If[ FromDigits[ Reverse[ IntegerDigits[n^n]]] == n^n, 0, NextPalindrome[n^n] - n^n]];
|
|
CROSSREFS
|
Sequence in context: A078290 A065239 A146892 this_sequence A012125 A123190 A165641
Adjacent sequences: A085801 A085802 A085803 this_sequence A085805 A085806 A085807
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Jul 24 2003
|
|
EXTENSIONS
|
Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 26 2003
|
|
|
Search completed in 0.002 seconds
|
