login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

G. C. Greubel, Table of n, a(n) for n = 1..10000

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].

Sequence in context: A091837 A316650 A216875 * A211872 A178166 A003855

Adjacent sequences:  A166707 A166708 A166709 * A166711 A166712 A166713

KEYWORD

base,nonn

AUTHOR

Zak Seidov, Oct 18 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 24 15:25 EDT 2019. Contains 323532 sequences. (Running on oeis4.)