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 A061999 #19 May 02 2022 01:39:15 %S A061999 0,1,2,6,64,8120,131860608,34774439752390528, %T A061999 2418523320185277177863741363978240, %U A061999 11698510100560033501377640350194228137500049288930688305497138757632 %N A061999 a(n) = 2*a(n-1)^2 - 2*a(n-2)^2 with a(0) = 0, a(1) = 1. %H A061999 Harry J. Smith, <a href="/A061999/b061999.txt">Table of n, a(n) for n = 0..12</a> %F A061999 a(n) = A062000(n)/2. %t A061999 Join[{a=0,b=1},Table[c=2*b^2-2*a^2;a=b;b=c,{n,10}]] (* _Vladimir Joseph Stephan Orlovsky_, Jan 22 2011 *) %t A061999 nxt[{a_,b_}]:={b,2b^2-2a^2}; NestList[nxt,{0,1},10][[All,1]] (* _Harvey P. Dale_, Apr 05 2022 *) %o A061999 (PARI) { for (n=0, 12, if (n>1, a=2*a1^2-2*a2^2; a2=a1; a1=a, if (n==0, a=a2=0, a=a1=1)); write("b061999.txt", n, " ", a) ) } \\ _Harry J. Smith_, Jul 29 2009 %o A061999 (SageMath) %o A061999 def a(n): # a = A061999 %o A061999 if (n<2): return n %o A061999 else: return 2*(a(n-1)^2 - a(n-2)^2) %o A061999 [a(n) for n in (0..14)] # _G. C. Greubel_, May 01 2022 %Y A061999 Cf. A062000. %K A061999 nonn %O A061999 0,3 %A A061999 _Henry Bottomley_, May 29 2001