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.

A214680 a(1)=3; a(n) is the smallest prime of the form k*a(n-1) + 2.

This page as a plain text file.
%I A214680 #20 Feb 20 2019 14:59:31
%S A214680 3,5,7,23,71,73,367,1103,7723,131293,3807499,19037497,57112493,
%T A214680 1427812327,15705935599,141353420393,989473942753,44526327423887,
%U A214680 311684291967211,4675264379508167,4675264379508169,275840598390981973,4137608975864729597
%N A214680 a(1)=3; a(n) is the smallest prime of the form k*a(n-1) + 2.
%C A214680 Up to the end of the b-file, there are only 4 pairs of twin primes in the sequence, with lesser twin primes 3, 5, 71 and 4675264379508167. - Editors, Feb 20 2018
%H A214680 Michael De Vlieger, <a href="/A214680/b214680.txt">Table of n, a(n) for n = 1..399</a>
%t A214680 t = {3}; Do[k = 1; While[p = k*t[[-1]] + 2; ! PrimeQ[p], k++]; AppendTo[t, p], {25}]; t (* _T. D. Noe_, Jul 26 2012 *)
%Y A214680 Cf. A061092, A059411, A214523.
%K A214680 nonn
%O A214680 1,1
%A A214680 _Robin Garcia_, Jul 25 2012