cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A156829 #12 Feb 08 2015 07:15:00
%S A156829 2,11,17,23,29,37,43,53,59,67,73,79,89,97,103,109,127,137,149,157,163,
%T A156829 173,179,191,197,211,223,229,239,251,257,263,269,277,283,293,307,313,
%U A156829 331,337,347,353,359,367,373,379,389,397,409,419,431,439,449,457,463
%N A156829 a(1) = 2. a(n) = the smallest prime >= a(n-1) + 6.
%p A156829 p := 2: for n from 1 to 1000 do printf("%d,",p) ; p := nextprime(p+5) ; od: # _R. J. Mathar_, Feb 22 2009
%t A156829 NestList[NextPrime[# + 5] &, 2, 45] (* _Zak Seidov_, Feb 08 2015 *)
%Y A156829 Cf. A156828.
%K A156829 nonn
%O A156829 1,1
%A A156829 _Leroy Quet_, Feb 16 2009
%E A156829 More terms from _R. J. Mathar_, Feb 22 2009