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.
%I A000289 M3316 N1333 #64 May 26 2025 09:53:18
%S A000289 1,4,7,31,871,756031,571580604871,326704387862983487112031,
%T A000289 106735757048926752040856495274871386126283608871,
%U A000289 11392521832807516835658052968328096177131218666695418950023483907701862019030266123104859068031
%N A000289 A nonlinear recurrence: a(n) = a(n-1)^2 - 3*a(n-1) + 3 (for n>1).
%C A000289 An infinite coprime sequence defined by recursion. - _Michael Somos_, Mar 14 2004
%C A000289 This is the special case k=3 of sequences with exact mutual k-residues. In general, a(1)=k+1 and a(n)=min{m | m>a(n-1), mod(m,a(i))=k, i=1,...,n-1}. k=1 gives Sylvester's sequence A000058 and k=2 Fermat sequence A000215. - _Seppo Mustonen_, Sep 04 2005
%D A000289 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A000289 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A000289 John Cerkan, <a href="/A000289/b000289.txt">Table of n, a(n) for n = 0..12</a>
%H A000289 A. V. Aho and N. J. A. Sloane, <a href="https://web.archive.org/web/2024*/https://www.fq.math.ca/Scanned/11-4/aho-a.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437.
%H A000289 A. V. Aho and N. J. A. Sloane, <a href="/A000058/a000058.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437 (original plus references that F.Q. forgot to include - see last page!)
%H A000289 S. W. Golomb, <a href="http://www.jstor.org/stable/2311857">On certain nonlinear recurring sequences</a>, Amer. Math. Monthly 70 (1963), 403-405.
%H A000289 Romeo Meštrović, <a href="https://arxiv.org/abs/1202.3670">Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof</a>, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - _N. J. A. Sloane_, Jun 13 2012
%H A000289 Seppo Mustonen, <a href="http://www.survo.fi/papers/resseq.pdf">On integer sequences with mutual k-residues</a>
%H A000289 Seppo Mustonen, <a href="/A000215/a000215.pdf">On integer sequences with mutual k-residues</a> [Local copy]
%H A000289 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A000289 a(n) = A005267(n) + 2 (for n>0).
%F A000289 a(n) = ceiling(c^(2^n)) + 1 where c = A077141. - _Benoit Cloitre_, Nov 29 2002
%F A000289 For n>0, a(n) = 3 + Product_{i=0..n-1} a(i). - _Vladimir Shevelev_, Dec 08 2010
%t A000289 Join[{1}, RecurrenceTable[{a[n] == a[n-1]^2 - 3*a[n-1] + 3, a[1] == 4}, a, {n, 1, 9}]] (* _Jean-François Alcover_, Feb 06 2016 *)
%o A000289 (PARI) a(n)=if(n<2,max(0,1+3*n),a(n-1)^2-3*a(n-1)+3)
%Y A000289 Cf. A000058.
%K A000289 nonn,easy
%O A000289 0,2
%A A000289 _N. J. A. Sloane_