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.

A214632 a(1) = 17, a(n) is smallest prime of the form k*a(n - 1) + 1.

This page as a plain text file.
%I A214632 #12 Apr 18 2014 11:12:30
%S A214632 17,103,619,2477,34679,416149,7490683,29962733,419478263,5872695683,
%T A214632 82217739563,986612874757,27625160493197,994505777755093,
%U A214632 5967034666530559,71604415998366709,6444397439853003811,180443128315884106709,9743928929057741762287
%N A214632 a(1) = 17, a(n) is smallest prime of the form k*a(n - 1) + 1.
%C A214632 Sequence does not begin with 2 (17 = 8*2 + 1; all primes are k*2+1) because 3 = 1*2 + 1 or 5 = 2*2 + 1 are smaller; and they would lead to A061092,  or A059411. Also: 7 belongs to A061092; 11 to A059411 and 13 is a(1) in A214523.
%H A214632 Harvey P. Dale, <a href="/A214632/b214632.txt">Table of n, a(n) for n = 1..300</a>
%e A214632 a(2) = 103 = 6*17 + 1.
%t A214632 t = {17}; Do[k = 1; While[p = k*t[[-1]] + 1; ! PrimeQ[p], k++]; AppendTo[t, p], {20}]; t (* _T. D. Noe_, Jul 24 2012 *)
%t A214632 nxt[n_]:=Module[{k=1},While[!PrimeQ[k*n+1],k++];k*n+1]; NestList[nxt,17,20] (* _Harvey P. Dale_, Apr 18 2014 *)
%Y A214632 Cf. A061092, A059411, A214523.
%K A214632 nonn
%O A214632 1,1
%A A214632 _Robin Garcia_, Jul 23 2012