login
a(0) = 2, a(1) = 3; for n>1, a(n) = a(n-2)^2 + a(n-1)^2.
1

%I #5 Oct 31 2013 12:23:02

%S 2,3,13,178,31853,1014645293,1029505071621669458,

%T 1059880692494738761409621021617069613,

%U 1123347082323126985848870489739619316533660939418089557571160604297983533

%N a(0) = 2, a(1) = 3; for n>1, a(n) = a(n-2)^2 + a(n-1)^2.

%D Harper's Magazine, Feb 2006, Page 14.

%t a[1] = 2; a[2] = 3; a[n_] := a[n - 2]^2 + a[n - 1]^2; Array[a, 9] (* _Robert G. Wilson v_ *)

%Y Cf. A000283.

%K nonn,easy

%O 0,1

%A Michael Hogan (Michael(AT)michaelhogan.com), Jan 10 2006

%E Corrected and extended by _Robert G. Wilson v_, Jan 11 2006