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 A152265 #21 Dec 25 2022 17:39:54
%S A152265 1,8,71,680,6833,70568,739607,7811336,82823777,879934280,9357993191,
%T A152265 99571637096,1059740581649,11280265991912,120079042716599,
%U A152265 1278289521926600,13608126915979457,144867527905855112
%N A152265 a(n) = ((8 + sqrt(7))^n + (8 - sqrt(7))^n)/2.
%C A152265 Binomial transform of A145302. Inverse binomial transform of A152266. - _Philippe Deléham_, Dec 03 2008
%H A152265 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (16, -57).
%F A152265 From _Philippe Deléham_, Dec 03 2008: (Start)
%F A152265 a(n) = 16*a(n-1) - 57*a(n-2), n > 1; a(0)=1, a(1)=8.
%F A152265 G.f.: (1-8*x)/(1-16*x+57*x^2).
%F A152265 a(n) = Sum_{k=0..n} A098158(n,k)*8^(2k-n)*7^(n-k). (End)
%F A152265 a(n) = Sum_{k=1..n} A056241(n,k) * 7^(k-1). - _J. Conrad_, Nov 23 2022
%o A152265 (Magma) Z<x>:= PolynomialRing(Integers()); N<r7>:=NumberField(x^2-7); S:=[ ((8+r7)^n+(8-r7)^n)/2: n in [0..17] ]; [ Integers()!S[j]: j in [1..#S] ]; // _Klaus Brockhaus_, Dec 03 2008
%Y A152265 Cf. A056241, A098158, A145302, A152266.
%K A152265 nonn
%O A152265 0,2
%A A152265 Al Hakanson (hawkuu(AT)gmail.com), Dec 01 2008
%E A152265 Extended beyond a(6) by _Klaus Brockhaus_, Dec 03 2008