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-3 of 3 results.

A195321 a(n) = 18*n^2.

Original entry on oeis.org

0, 18, 72, 162, 288, 450, 648, 882, 1152, 1458, 1800, 2178, 2592, 3042, 3528, 4050, 4608, 5202, 5832, 6498, 7200, 7938, 8712, 9522, 10368, 11250, 12168, 13122, 14112, 15138, 16200, 17298, 18432, 19602, 20808, 22050, 23328, 24642, 25992, 27378, 28800, 30258, 31752
Offset: 0

Views

Author

Omar E. Pol, Sep 16 2011

Keywords

Comments

Sequence found by reading the line from 0, in the direction 0, 18, ..., in the square spiral whose vertices are the generalized hendecagonal numbers A195160. Semi-axis opposite to A195316 in the same spiral.
Area of a square with diagonal 6n. - Wesley Ivan Hurt, Jun 19 2014
Number of identical tessellation tiles that are composed of 48 equilateral edge joined triangles that can be formed into a order n hexagon. The example tiles shown in the link below are tessellated with eight sphinx tiles. See A291582. - Craig Knecht, Sep 02 2017

Links

Crossrefs

Bisection of A195147.
Cf. A016802, A033581, A033583, A135453, A139098, A144555, A195322, A195323.
Cf. A000290, A001105, A008600, A016766, A033428, A195160, A195316, A291582.

Programs

Formula

a(n) = 18*A000290(n) = 9*A001105(n) = 6*A033428(n) = 3*A033581(n) = 2*A016766(n).
G.f.: 18*x*(1+x)/(1-x)^3. - Wesley Ivan Hurt, Jun 20 2014
From Elmo R. Oliveira, Dec 01 2024: (Start)
E.g.f.: 18*x*(1 + x)*exp(x).
a(n) = n*A008600(n) = A195147(2*n).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

A153792 12 times pentagonal numbers: a(n) = 6*n*(3*n-1).

Original entry on oeis.org

0, 12, 60, 144, 264, 420, 612, 840, 1104, 1404, 1740, 2112, 2520, 2964, 3444, 3960, 4512, 5100, 5724, 6384, 7080, 7812, 8580, 9384, 10224, 11100, 12012, 12960, 13944, 14964, 16020, 17112, 18240, 19404, 20604, 21840, 23112, 24420
Offset: 0

Views

Author

Omar E. Pol, Jan 01 2009

Keywords

Comments

For n>=1, a(n) is the first Zagreb index of the triangular grid graph T[n] (see the West reference, p. 390). The first Zagreb index of a simple connected graph is the sum of the squared degrees of its vertices. Alternately, it is the sum of the degree sums d(i)+d(j) over all edges ij of the graph. - Emeric Deutsch, Nov 10 2016
The M-polynomial of the triangular grid graph T[n] is M(T[n], x, y) = 6*x^2*y^4 + 3*(n-1)*x^4*y^4 +6*(n-2)*x^4*y^6+3*(n-2)*(n-3)*x^6*y^6/2. - Emeric Deutsch, May 09 2018
This is the number of overlapping six sphinx tiled shapes in the sphinx tessellated hexagon described in A291582. - Craig Knecht, Sep 13 2017
a(n) is the number of words of length 3n over the alphabet {a,b,c}, where the number of b's plus the number of c's is 2. - Juan Camacho, Mar 03 2021
Sequence found by reading the line from 0, in the direction 0, 12, ..., in the square spiral whose vertices are the generalized 11-gonal numbers A195160. - Omar E. Pol, Mar 12 2021

References

  • D. B. West, Introduction to Graph Theory, 2nd edition, Prentice-Hall, 2001.

Links

Crossrefs

Cf. A000326, A049450, A062741, A033579, A152743, A153449, A153793.
Cf. A008588, A195160, A195321.

Programs

Formula

a(n) = 18*n^2 - 6*n = 12*A000326(n) = 6*A049450(n) = 4*A062741(n) = 3*A033579(n) = 2*A152743(n).
a(n) = 36*n + a(n-1) - 24 (with a(0)=0). - Vincenzo Librandi, Aug 03 2010
G.f.: 12*x*(1 + 2*x)/(1-x)^3. - Colin Barker, Feb 14 2012
a(0)=0, a(1)=12, a(2)=60; for n>2, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Mar 11 2012
E.g.f.: 6*x*(2 + 3*x)*exp(x). - G. C. Greubel, Aug 29 2016
a(n) = A291582(n) - A195321(n) for n > 0. - Craig Knecht, Sep 13 2017
a(n) = A195321(n) - A008588(n). - Omar E. Pol, Mar 12 2021
From Amiram Eldar, May 05 2025: (Start)
Sum_{n>=1} 1/a(n) = log(3)/4 - Pi/(12*sqrt(3)).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/(6*sqrt(3)) - log(2)/3. (End)

A298267 a(n) is the maximum number of heptiamonds in a hexagon of order n.

Original entry on oeis.org

0, 3, 7, 13, 21, 30, 42, 54, 69, 85, 103, 123, 144, 168, 192, 219, 247, 277, 309, 342, 378, 414, 453, 493, 535, 579, 624, 672, 720, 771, 823, 877, 933, 990, 1050, 1110, 1173, 1237, 1303, 1371, 1440, 1512, 1584, 1659, 1735, 1813, 1893, 1974, 2058, 2142
Offset: 0

Views

Author

Craig Knecht, Jan 15 2018

Keywords

Comments

There are 24 heptiamonds.
It would be nice if this idea could be generalized to state that the hexagon can contain the maximum number of polyiamonds of any given size.

Links

Crossrefs

Cf. A033581 (The number of triangles in a hexagon), A291582 (hexiamond tiling).

Programs

Formula

a(n) = floor((6*n^2)/7).
Conjectures from Colin Barker, Jan 20 2018: (Start)
G.f.: x*(1 + x)*(3 - 2*x + 4*x^2 - 2*x^3 + 3*x^4) / ((1 - x)^3*(1 + x + x^2 + x^3 + x^4 + x^5 + x^6)).
a(n) = 2*a(n-1) - a(n-2) + a(n-7) - 2*a(n-8) + a(n-9) for n>8.
(End)
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.