login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

%I

%S 10,10,10,10,11,111,23,21,212,32,1011,52,221,223,65,203,65,141,124,

%T 131,133,87,123,108,117,101,10211,212,131,11012,241,11212,254,164,175,

%U 1101,313,431,326,335,218,265,232,234,238,241,11010011,22021,443,274,22122

%N a(n)=prime(n) written in base the largest digit of prime(n).

%C If prime(n) is a repunit then a(n)=prime(n) by convention.

%H G. C. Greubel, <a href="/A166710/b166710.txt">Table of n, a(n) for n = 1..10000</a>

%e a(6)=23 because p(6)=13 written in base 3 is 23,

%e a(7)=21 because p(7)=19 written in base 9 is 21.

%t Table[p=Prime[n];id=IntegerDigits[p];ma=If[Max[id]==1,10,Max[id]];FromDigits[IntegerDigits[p,ma]],{n,1,128}]

%Y Cf. A072803 n written in base Mod[n, 10].

%K base,nonn

%O 1,1

%A _Zak Seidov_, Oct 18 2009

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 12 04:27 EDT 2021. Contains 343810 sequences. (Running on oeis4.)