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 A112259 #33 Feb 28 2024 19:24:41
%S A112259 1,5,9,605,961,16245,284089,29645,15046641,101025125,73222249,
%T A112259 9908816445,23755748641,204034140245,5031349566489,1965713970605,
%U A112259 219320727489361,1965265930868805,374345220088009,158335559155140125
%N A112259 Expansion of x*(1+8*x)/((1-8*x)*(1+11*x+64*x^2)).
%C A112259 Previous name was: Let p = the golden mean = (1+sqrt(5))/2. A point in 3-space is identified by three numbers t = (a,b,c). f(t) is the product a*b*c. Let t = (-1/p,1,p): using the rules of 'triternion' multiplication, e.g., (1,2,3)*(1,2,3)= 1,2,3 + 6,2,4 + 6,9,3 = (13,13,10), then -f(t^n) gives the sequence.
%C A112259 Numbers in the sequence are alternatively products of squares or five times a product of squares.
%C A112259 If f(t) is the sum of a+b+c then a(n)=2^(n+1). - _Robert G. Wilson v_, May 16 2006
%H A112259 Vincenzo Librandi, <a href="/A112259/b112259.txt">Table of n, a(n) for n = 1..1000</a>
%H A112259 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (-3,24,512).
%F A112259 t = (-1/p, 1, p). f(t) is the product 1/p*1*p. For t1 = (a, b, c) and t2 = (x, y, z), t1 - t2 = a(x, y, z) + b(z, x, y) + c(y, z, x) = (ax+bz+cy, ay+bx+cz, az+by+cx). -f(t^n) = the sequence.
%F A112259 G.f.: x*(1+8*x)/((1-8*x)*(1+11*x+64*x^2)). [_Joerg Arndt_, Aug 03 2013]
%F A112259 From _G. C. Greubel_, Sep 21 2020: (Start)
%F A112259 a(n) = 2^(3*n+1) * (1 - (-1)^n * T_{n}(11/16))/27, where T_{n}(x) is the Chebyshev polynomial.
%F A112259 a(n) = -3*a(n-1) + 24*a(n-2) + 512*a(n-3). (End)
%e A112259 t = (-0.618...,1,1.618...); t^2 = (3.618...,1.381...,-1). Hence -f(t^2) = 5
%t A112259 s = {-1/GoldenRatio, 1, GoldenRatio}; trit[lst_] := Block[{a, b, c, d, e, f}, {a, b, c} = lst[[1]]; {d, e, f} = lst[[2]]; {{a, b, c}, FullSimplify[{a*d + b*f + c*e, a*e + b*d + c*f, a*f + b*e + c*d}]}]; f[n_] := FullSimplify[ -Times @@ Nest[trit, {s, s}, n][[2]]]; Table[ f[n], {n, 0, 20}] (* _Robert G. Wilson v_, May 16 2006 *)
%t A112259 CoefficientList[Series[(1 + 8 x) / ((1 - 8 x) (1 + 11 x + 64 x^2)), {x, 0, 20}], x] (* _Vincenzo Librandi_, Aug 04 2013 *)
%t A112259 LinearRecurrence[{-3,24,512},{1,5,9},20] (* _Harvey P. Dale_, Feb 28 2024 *)
%Y A112259 Cf. A001622, A112260, A112261.
%K A112259 nonn,easy
%O A112259 1,2
%A A112259 _Russell Walsmith_, Aug 30 2005
%E A112259 More terms from _Robert G. Wilson v_, May 16 2006
%E A112259 New name using g.f. from _Joerg Arndt_, Sep 20 2020