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!)
A156829 a(1) = 2. a(n) = the smallest prime >= a(n-1) + 6. 2

%I #12 Feb 08 2015 07:15:00

%S 2,11,17,23,29,37,43,53,59,67,73,79,89,97,103,109,127,137,149,157,163,

%T 173,179,191,197,211,223,229,239,251,257,263,269,277,283,293,307,313,

%U 331,337,347,353,359,367,373,379,389,397,409,419,431,439,449,457,463

%N a(1) = 2. a(n) = the smallest prime >= a(n-1) + 6.

%p p := 2: for n from 1 to 1000 do printf("%d,",p) ; p := nextprime(p+5) ; od: # _R. J. Mathar_, Feb 22 2009

%t NestList[NextPrime[# + 5] &, 2, 45] (* _Zak Seidov_, Feb 08 2015 *)

%Y Cf. A156828.

%K nonn

%O 1,1

%A _Leroy Quet_, Feb 16 2009

%E More terms from _R. J. Mathar_, Feb 22 2009

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 19 08:20 EDT 2024. Contains 371782 sequences. (Running on oeis4.)