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.

A072532 a(0)=1; for n>0, a(n) = smallest prime of the form k*a(n-1)-1 with k>1.

This page as a plain text file.
%I A072532 #16 Oct 19 2017 03:14:04
%S A072532 1,2,3,5,19,37,73,1021,8167,16333,326659,3919907,47038883,188155531,
%T A072532 2257866371,76767456613,1535349132259,12282793058071,147393516696851,
%U A072532 4127018467511827,107302480155307501,1502234722174305013
%N A072532 a(0)=1; for n>0, a(n) = smallest prime of the form k*a(n-1)-1 with k>1.
%C A072532 Conjecture: If a(n) = k*a(n-1)-1 then k < a(n-1).
%C A072532 A theorem of Dirichlet shows the sequence to be infinite. - _Don Reble_, Aug 03 2002
%H A072532 T. D. Noe, <a href="/A072532/b072532.txt">Table of n, a(n) for n=0..100</a>
%t A072532 f[n_]:=Module[{k=2},While[!PrimeQ[k*n-1],k++];k*n-1]; Join[{1}, NestList[ f,2,35]] (* _Harvey P. Dale_, Jun 27 2011 *)
%Y A072532 Cf. A061092.
%K A072532 nice,nonn
%O A072532 0,2
%A A072532 _Amarnath Murthy_, Aug 02 2002
%E A072532 More terms from _Don Reble_, Aug 03 2002