|
| |
|
|
A137779
|
|
Number of bases (numbering systems, including unary) in which the n-th prime is a palindrome having at least two digits.
|
|
2
| |
|
|
1, 2, 3, 3, 2, 3, 4, 2, 3, 3, 4, 3, 3, 3, 2, 2, 3, 3, 4, 3, 4, 2, 3, 3, 3, 3, 2, 4, 4, 3, 4, 3, 2, 2, 2, 4, 4, 2, 2, 4, 2, 4, 5, 3, 4, 3, 4, 2, 4, 3, 3, 3, 4, 3, 6, 2, 2, 4, 4, 3, 2, 2, 4, 2, 5, 2, 3, 5, 2, 3, 5, 2, 2, 6, 5, 3, 2, 3, 4, 4, 4, 5, 3, 4, 2, 5, 3, 4, 4, 4, 3, 3, 4, 2, 3, 3, 3, 4, 4
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Each prime p > 2 is palindrome in at least base 1 and base p-1, since p = 1*(p-1)^1 + 1*(p-1)^0 and p = 1*1^(p-1) + 1*1(p-2) + ... + 1*1^1 + 1*1^0.
|
|
|
LINKS
| Attila Olah, Table of n, a(n) for n = 1..10000
|
|
|
EXAMPLE
| a(621) = 9 because the 621th prime (4591) is a palindrome in 9 bases: base 1, 19, 20, 24, 33, 37, 51, 54 and 4590 (4591 = 1*4590^1 + 1*4590^0).
|
|
|
CROSSREFS
| Cf. A087911.
Sequence in context: A007538 A025076 A110006 * A191246 A107918 A002963
Adjacent sequences: A137776 A137777 A137778 * A137780 A137781 A137782
|
|
|
KEYWORD
| easy,base,nonn
|
|
|
AUTHOR
| Attila Olah (jolafix(AT)gmail.com), May 06 2008, corrected May 08 2008
|
| |
|
|
