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!)
A152605 a(1) = 1; thereafter a(n) is always the smallest integer > a(n-1) not leading to a contradiction, such that any five consecutive digits in the sequence sum up to a prime. 3
1, 2, 3, 4, 7, 12, 30, 51, 83, 231, 232, 312, 323, 327, 413, 414, 530, 541, 701, 811, 812, 1101, 2110, 3011, 6301, 7030, 7103, 8110, 9011, 21011, 21013, 21017, 21019, 21053, 21055, 21059, 21071, 21073, 21077, 21079, 21413, 21415, 21419 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Computed by Jean-Marc Falcoz.

From a(116)=6100011 on, there starts a pattern of 75 terms which then repeats indefinitely (with duplication of a substring of 5 digits in the middle of each term). - M. F. Hasler, Oct 16 2009

LINKS

Table of n, a(n) for n=1..43.

Eric Angelini, Chiffres consecutifs dans quelques suites

E. Angelini, Chiffres consecutifs dans quelques suites [Cached copy, with permission]

PROG

(PARI) A152605(n, show_all=0, s=[1, 2, 3, 4, 7, 12, 30, 51, 83, 231, 232, 312, 323, 327, 413, 414, 530, 541, 701, 811, 812, 1101])={ my(a); for(i=1, n, if(i<=#s, a=s[i], my(ld=a%10^4); while(a++, my(t=a+ld*10^#Str(a)); forstep(d=#Str(a)-1, 0, -1, isprime(sum(j=d, d+4, t\10^j%10))&next; a+=10^d-a%10^d-1; next(2)); break)); show_all&print1(a", ")); a } \\ M. F. Hasler, Oct 16 2009

CROSSREFS

Cf. A158652, A152603, A152604, A152606, A152607, A152608, A152609.

Sequence in context: A215981 A107031 A207573 * A285222 A023162 A022437

Adjacent sequences:  A152602 A152603 A152604 * A152606 A152607 A152608

KEYWORD

nonn,base

AUTHOR

N. J. A. Sloane, Sep 23 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 September 25 12:57 EDT 2021. Contains 347654 sequences. (Running on oeis4.)