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.

Showing 1-2 of 2 results.

A152751 3 times octagonal numbers: a(n) = 3*n*(3*n-2).

Original entry on oeis.org

0, 3, 24, 63, 120, 195, 288, 399, 528, 675, 840, 1023, 1224, 1443, 1680, 1935, 2208, 2499, 2808, 3135, 3480, 3843, 4224, 4623, 5040, 5475, 5928, 6399, 6888, 7395, 7920, 8463, 9024, 9603, 10200, 10815, 11448, 12099, 12768, 13455, 14160, 14883, 15624, 16383, 17160
Offset: 0

Views

Author

Omar E. Pol, Dec 12 2008

Keywords

Comments

a(n) also can be represented as n concentric triangles (see example). - Omar E. Pol, Aug 21 2011

Examples

			From _Omar E. Pol_, Aug 21 2011: (Start)
Illustration of initial terms as concentric triangles:
.
.                                          o
.                                         o o
.                                        o   o
.                                       o     o
.                 o                    o   o   o
.                o o                  o   o o   o
.               o   o                o   o   o   o
.              o     o              o   o     o   o
.    o        o   o   o            o   o   o   o   o
.   o o      o   o o   o          o   o   o o   o   o
.           o           o        o   o           o   o
.          o o o o o o o o      o   o o o o o o o o   o
.                              o                       o
.                             o o o o o o o o o o o o o o
.
.    3            24                       63
(End)
		

Crossrefs

Cf. A033581, A085250, A152734, A194273. - Omar E. Pol, Aug 21 2011
Cf. numbers of the form n*(n*k - k + 6)/2, this sequence is the case k=18: see Comments lines of A226492.

Programs

Formula

a(n) = 9*n^2 - 6*n = 3*A000567(n) = A064201(n)/3.
a(n) = a(n-1) + 18*n - 15 with n > 0, a(0)=0. - Vincenzo Librandi, Nov 26 2010
G.f.: 3*x*(1+5*x)/(1-x)^3. - Bruno Berselli, Jan 21 2011
From Elmo R. Oliveira, Dec 25 2024: (Start)
E.g.f.: 3*exp(x)*x*(1 + 3*x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3.
a(n) = n + A152995(n). (End)

A153808 8 times octagonal numbers: 8*n*(3*n-2).

Original entry on oeis.org

0, 8, 64, 168, 320, 520, 768, 1064, 1408, 1800, 2240, 2728, 3264, 3848, 4480, 5160, 5888, 6664, 7488, 8360, 9280, 10248, 11264, 12328, 13440, 14600, 15808, 17064, 18368, 19720, 21120, 22568, 24064, 25608, 27200, 28840, 30528, 32264
Offset: 0

Views

Author

Omar E. Pol, Jan 19 2009

Keywords

Crossrefs

Cf. A000567 (octagonal numbers), A064201 (9 times octagonal numbers), A139267 (twice octagonal numbers), A152751 (3 times octagonal numbers), A153794 (4 times octagonal numbers).

Programs

  • Magma
    [ 8*n*(3*n-2): n in [0..40] ];
    
  • Mathematica
    Table[8*n*(3*n-2), {n,0,25}] (* or *) LinearRecurrence[{3,-3,1},{0,8,64}, 25] (* G. C. Greubel, Aug 29 2016 *)
    8*PolygonalNumber[8,Range[0,40]] (* Harvey P. Dale, Nov 22 2023 *)
  • PARI
    a(n)=24*n^2-16*n \\ Charles R Greathouse IV, Jun 17 2017

Formula

a(n) = 24*n^2 - 16*n = 8*A000567(n) = 4*A139267(n) = 2*A153794(n).
a(n) = a(n-1) + 48*n - 40 (with a(0)=0). - Vincenzo Librandi, Nov 27 2010
From G. C. Greubel, Aug 29 2016: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
G.f.: 8*x*(1 + 5*x)/(1 - x)^3.
E.g.f.: 8*x*(1 + 3*x)*exp(x). (End)
Showing 1-2 of 2 results.