Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #12 Sep 08 2022 08:46:19
%S 1,1,3,11,131,17283,298719251,89233191216703091,
%T 7962562414716697755180182566955283,
%U 63402400208259008611705446682872670539115181497111590988296570564371
%N Quadratic recurrence: a(n+2) = a(n+1)^2 + a(n)^2 + 1, with a(0) = a(1) = 1.
%F a(n+3) = a(n+2)^2 + a(n+2) - a(n)^2, with a(0) = a(1) = 1, a(2) = 3.
%F a(n) ~ c^(2^n), where c = 1.356519333072951374233963037913978335267300244021120535099185060013... - _Vaclav Kotesovec_, Apr 15 2017
%t RecurrenceTable[{a[n + 2] == a[n + 1]^2 + a[n]^2 + 1, a[0] == 1, a[1] == 1}, a, {n, 0, 12}]
%o (Maxima) a(n) := if (n=0 or n=1) then 1 else a(n-1)^2 + a(n-2)^2 + 1; makelist(a(n), n, 0, 12);
%o (Magma) [n le 2 select 1 else Self(n-1)^2+Self(n-2)^2+1: n in [1..10]]; // _Bruno Berselli_, Mar 30 2017
%Y Cf. A000283.
%K nonn
%O 0,3
%A _Emanuele Munarini_, Mar 30 2017