login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264917 a(n) is the greatest prime number with prime(1) digits 1, prime(2) digits 2, prime(3) digits 3, ..., prime(n) digits n with 1 <= n <= 9 or 0 if no such prime exists. 2

%I #31 Jan 19 2019 21:05:29

%S 11,21221,3333322121,0,5555555555544444443332311223,

%T 66666666666665555555555544444443333122321,0

%N a(n) is the greatest prime number with prime(1) digits 1, prime(2) digits 2, prime(3) digits 3, ..., prime(n) digits n with 1 <= n <= 9 or 0 if no such prime exists.

%C This sequence is finite and has 9 terms.

%C a(4)=0 and a(7)=0, since all the candidates are divisible by 3.

%C a(9)=99...988...877...766...655..544444443333322211 is the last term.

%H Giovanni Resta, <a href="/A264917/b264917.txt">Table of n, a(n) for n = 1..9</a>

%Y Cf. A272161.

%K nonn,base,fini,full

%O 1,1

%A _Pierre CAMI_, Apr 30 2016

%E a(5)-a(7) from _Giovanni Resta_, May 05 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 06:24 EDT 2024. Contains 371769 sequences. (Running on oeis4.)