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.

A051957 a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) - 1 is a prime.

This page as a plain text file.
%I A051957 #20 Oct 14 2021 18:13:02
%S A051957 3,4,5,6,8,9,11,14,18,20,21,27,28,37,62,77,86,97,100,107,109,166,167,
%T A051957 181,196,225,262,266,268,274,278,290,305,345,378,385,414,429,438,442,
%U A051957 498,503,516,531,573,595,596,611,640,665,749,794,870
%N A051957 a(n) = smallest number > a(n-1) such that a(1)*a(2)*...*a(n) - 1 is a prime.
%H A051957 Amiram Eldar, <a href="/A051957/b051957.txt">Table of n, a(n) for n = 1..1000</a> (terms 1..200 from T. D. Noe)
%t A051957 seq={3};Do[n=Last[seq]+1;While[!PrimeQ[n Times@@seq-1],n++]; AppendTo[ seq,n];,{60}];seq (* _Harvey P. Dale_, Oct 21 2011 *)
%Y A051957 Cf. A046966, A051956.
%K A051957 nice,nonn
%O A051957 1,1
%A A051957 _Felice Russo_, Dec 21 1999