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
11, 21221, 3333322121, 0, 5555555555544444443332311223, 66666666666665555555555544444443333122321, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

This sequence is finite and has 9 terms.

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

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

LINKS

Giovanni Resta, Table of n, a(n) for n = 1..9

CROSSREFS

Cf. A272161.

Sequence in context: A252862 A232066 A330301 * A198668 A346206 A198707

Adjacent sequences:  A264914 A264915 A264916 * A264918 A264919 A264920

KEYWORD

nonn,base,fini,full

AUTHOR

Pierre CAMI, Apr 30 2016

EXTENSIONS

a(5)-a(7) from Giovanni Resta, May 05 2016

STATUS

approved

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 September 29 22:48 EDT 2022. Contains 357092 sequences. (Running on oeis4.)