login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A219674 a(n) = smallest prime not included earlier such that a(n-4) + a(n-3) + a(n-2) + a(n-1) + a(n) is a prime, with a(1)=1, a(2)=3, a(3)=5, and a(4)=7. 0
1, 3, 5, 7, 13, 19, 17, 11, 23, 31, 67, 41, 29, 43, 47, 37, 71, 53, 61, 59, 73, 101, 79, 89, 97, 83, 109, 113, 107, 151, 127, 103, 131, 149, 137, 139, 163, 173, 157, 179, 167, 181, 193, 191, 197, 229, 199, 223, 239, 227, 241, 233, 211, 251, 257, 271, 269, 313, 263 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MATHEMATICA

f[s_List] := Block[{pn = s[[-4]] + s[[-3]] + s[[-2]] + s[[-1]], p = 2}, While[ MemberQ[s, p] || ! PrimeQ[p + pn], p = NextPrime@ p]; Append[s, p]]; Nest[f, {1, 3, 5, 7}, 55]

CROSSREFS

Cf. A073653.

Sequence in context: A227531 A079481 A291867 * A075571 A077133 A164642

Adjacent sequences:  A219671 A219672 A219673 * A219675 A219676 A219677

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v, Nov 28 2012

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 January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)