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 A153808 #18 Nov 22 2023 15:01:35
%S A153808 0,8,64,168,320,520,768,1064,1408,1800,2240,2728,3264,3848,4480,5160,
%T A153808 5888,6664,7488,8360,9280,10248,11264,12328,13440,14600,15808,17064,
%U A153808 18368,19720,21120,22568,24064,25608,27200,28840,30528,32264
%N A153808 8 times octagonal numbers: 8*n*(3*n-2).
%H A153808 G. C. Greubel, <a href="/A153808/b153808.txt">Table of n, a(n) for n = 0..999</a>
%H A153808 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F A153808 a(n) = 24*n^2 - 16*n = 8*A000567(n) = 4*A139267(n) = 2*A153794(n).
%F A153808 a(n) = a(n-1) + 48*n - 40 (with a(0)=0). - _Vincenzo Librandi_, Nov 27 2010
%F A153808 From _G. C. Greubel_, Aug 29 2016: (Start)
%F A153808 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
%F A153808 G.f.: 8*x*(1 + 5*x)/(1 - x)^3.
%F A153808 E.g.f.: 8*x*(1 + 3*x)*exp(x). (End)
%t A153808 Table[8*n*(3*n-2), {n,0,25}] (* or *) LinearRecurrence[{3,-3,1},{0,8,64}, 25] (* _G. C. Greubel_, Aug 29 2016 *)
%t A153808 8*PolygonalNumber[8,Range[0,40]] (* _Harvey P. Dale_, Nov 22 2023 *)
%o A153808 (Magma) [ 8*n*(3*n-2): n in [0..40] ];
%o A153808 (PARI) a(n)=24*n^2-16*n \\ _Charles R Greathouse IV_, Jun 17 2017
%Y A153808 Cf. A000567 (octagonal numbers), A064201 (9 times octagonal numbers), A139267 (twice octagonal numbers), A152751 (3 times octagonal numbers), A153794 (4 times octagonal numbers).
%K A153808 easy,nonn
%O A153808 0,2
%A A153808 _Omar E. Pol_, Jan 19 2009