|
|
A083136
|
|
a(n+1) is the smallest palindrome greater than a(n) and relatively prime to a(n).
|
|
5
|
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, 313, 323, 333, 343, 353, 363, 373, 383, 393, 404, 515, 606, 727, 737, 747, 757, 767, 777, 787, 797, 808, 919, 929, 939, 949, 959, 969, 979, 989, 999, 1001, 10001, 10101, 10201
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Contains at most one 2k-digit number for every k, since all such palindromes are divisible by 11. - Ivan Neretin, Aug 12 2015
|
|
LINKS
|
|
|
MATHEMATICA
|
spal[n_]:=Module[{k=n+1}, While[!PalindromeQ[k]||!CoprimeQ[k, n], k++]; k]; NestList[spal, 1, 60] (* Harvey P. Dale, May 09 2021 *)
|
|
PROG
|
(PARI) ispal(n) = my(d=digits(n)); d == Vecrev(d);
lista(nn) = {print1(last = 1, ", "); for (n=2, nn, if (ispal(n) && gcd(n, last)== 1, print1(n, ", "); last = n; ); ); } \\ Michel Marcus, Aug 12 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 24 2003
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|