|
|
A166710
|
|
a(n)=prime(n) written in base the largest digit of prime(n).
|
|
1
|
|
|
10, 10, 10, 10, 11, 111, 23, 21, 212, 32, 1011, 52, 221, 223, 65, 203, 65, 141, 124, 131, 133, 87, 123, 108, 117, 101, 10211, 212, 131, 11012, 241, 11212, 254, 164, 175, 1101, 313, 431, 326, 335, 218, 265, 232, 234, 238, 241, 11010011, 22021, 443, 274, 22122
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
If prime(n) is a repunit then a(n)=prime(n) by convention.
|
|
LINKS
|
|
|
EXAMPLE
|
a(6)=23 because p(6)=13 written in base 3 is 23,
a(7)=21 because p(7)=19 written in base 9 is 21.
|
|
MATHEMATICA
|
Table[p=Prime[n]; id=IntegerDigits[p]; ma=If[Max[id]==1, 10, Max[id]]; FromDigits[IntegerDigits[p, ma]], {n, 1, 128}]
|
|
CROSSREFS
|
Cf. A072803 n written in base Mod[n, 10].
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|