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.

A144744 Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=4.

This page as a plain text file.
%I A144744 #12 May 06 2015 06:56:38
%S A144744 4,11,109,11771,138544669,19194625169774891,
%T A144744 368433635408155743950638444286989,
%U A144744 135743343700069833946317076518699443524748244656296738254150399131
%N A144744 Recurrence sequence a(n)=a(n-1)^2-a(n-1)-1, a(0)=4.
%C A144744 a(0)=3 is the smallest integer generating an increasing sequence of the form a(n)=a(n-1)^2-a(n-1)-1.
%F A144744 a(n)=a(n-1)^2-a(n-1)-1 and a(0)=4.
%F A144744 a(n) ~ c^(2^n), where c = 3.22737450272053234771396610986262048906046050824600724014923334412606964... . - _Vaclav Kotesovec_, May 06 2015
%t A144744 a = {}; k = 4; Do[k = k^2 - k - 1; AppendTo[a, k], {n, 1, 10}]; a
%o A144744 (PARI) a(n, s=4)={for(i=1, n, s=s^2-s-1); s} \\ _M. F. Hasler_, Oct 06 2014
%Y A144744 Cf. A000058, A082732, A144743, A144745, A144746, A144747, A144748.
%K A144744 nonn
%O A144744 0,1
%A A144744 _Artur Jasinski_, Sep 20 2008
%E A144744 Edited by _M. F. Hasler_, Oct 06 2014