cp's OEIS Frontend

A014253 a(n) = b(n)^2, where b(n) = b(n-1)^2 + b(n-2)^2 (A000283).

%I A014253 #20 Sep 08 2022 08:44:39
%S A014253 0,1,1,4,25,841,749956,563696135209,317754178344723197077225,
%T A014253 100967717855888389973004528722798800700252204356
%N A014253 a(n) = b(n)^2, where b(n) = b(n-1)^2 + b(n-2)^2 (A000283).
%H A014253 G. C. Greubel, <a href="/A014253/b014253.txt">Table of n, a(n) for n = 0..13</a>
%H A014253 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A014253 a(n+2) = (a(n+1) + a(n))^2. - _Benoit Cloitre_, Dec 29 2001
%t A014253 RecurrenceTable[{a[n]==(a[n-1]+a[n-2])^2, a[0]==0, a[1]==1}, a, {n,0,10}] (* _G. C. Greubel_, Jun 18 2019 *)
%o A014253 (Magma) [0] cat [n le 2 select 1 else (Self(n-1)+Self(n-2))^2: n in [1..10]]; // _Vincenzo Librandi_, Apr 02 2015
%o A014253 (PARI) m=10; v=concat([0,1], vector(m-2)); for(n=3, m, v[n]=(v[n-1] + v[n-2])^2); v \\ _G. C. Greubel_, Jun 18 2019
%o A014253 (Sage)
%o A014253 def a(n):
%o A014253     if (n==0): return 0
%o A014253     elif (n==1): return 1
%o A014253     else: return (a(n-1) + a(n-2))^2
%o A014253 [a(n) for n in (0..10)] # _G. C. Greubel_, Jun 18 2019
%K A014253 nonn
%O A014253 0,4
%A A014253 _N. J. A. Sloane_