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.

A242995 a(n) = a(n-1)^2 + a(n-1)*a(n-2)^2 - a(n-2)^4 with a(1) = 2, a(2) = 3.

This page as a plain text file.
%I A242995 #28 Sep 08 2022 08:46:08
%S A242995 2,3,5,-11,-779,497941,181860254581,16687694789137362648661,
%T A242995 -263439569256003706800705587722279993788907979
%N A242995 a(n) = a(n-1)^2 + a(n-1)*a(n-2)^2 - a(n-2)^4 with a(1) = 2, a(2) = 3.
%H A242995 G. C. Greubel, <a href="/A242995/b242995.txt">Table of n, a(n) for n = 1..13</a>
%H A242995 M. Chamberland and M. Martelli, <a href="https://chamberland.math.grinnell.edu/papers/mario_digits.pdf">Unbounded Orbits and Binary Digits</a>, Grinnell College.
%H A242995 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A242995 0 = a(n)^2*(a(n+1) - a(n)^2) - (a(n+2) - a(n+1)^2) for all n>0.
%F A242995 abs(a(n)) = abs(A127814(n)) for all n>0.
%F A242995 a(n) = A242996(n+1) / A242996(n) for all n>0.
%t A242995 RecurrenceTable[{a[n] == a[n-1]^2 + a[n-1]*a[n-2]^2 - a[n-2]^4, a[1] == 2, a[2] == 3}, a, {n, 1, 10}] (* _G. C. Greubel_, Aug 05 2018 *)
%o A242995 (PARI) {a(n) = if( n<1, 0, if( n<3, n+1, my(x = a(n-2)^2, y = a(n-1)); y^2 + x*y - x^2))};
%o A242995 (Magma) I:=[2,3]; [n le 2 select I[n] else Self(n-1)^2 + Self(n-1)*Self(n-2)^2 - Self(n-2)^4: n in [1..10]]; // _G. C. Greubel_, Aug 05 2018
%Y A242995 Cf. A127814, A242996.
%K A242995 sign
%O A242995 1,1
%A A242995 _Michael Somos_, Aug 17 2014