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.

A289134 a(n) = 21*n^2 - 33*n + 13.

Original entry on oeis.org

1, 31, 103, 217, 373, 571, 811, 1093, 1417, 1783, 2191, 2641, 3133, 3667, 4243, 4861, 5521, 6223, 6967, 7753, 8581, 9451, 10363, 11317, 12313, 13351, 14431, 15553, 16717, 17923, 19171, 20461, 21793, 23167, 24583, 26041, 27541, 29083, 30667, 32293
Offset: 1

Views

Author

Keywords

Comments

a(n) is the sum of all cells in a cellular-automata-like hexagonal lattice growth from a single active seed, based upon whether each hexagonal unit is active plus how many active neighbors each cell is touching for all active cells in the lattice.
The initial hexagonal seed starts with a single 1 representing it is active and touching no active neighbors. In the next time step, all inactive hexagonal neighboring spaces in the surrounding hexagonal lattice which were touching the active seed via edges become active and all active cells are summed together based on whether they are active plus how many active neighbors they are touching via their edges. This continues for each time step with inactive neighbors touching active neighbors in the previous time step becoming active in the current step followed by the described summing.

Crossrefs

Cf. A033574 (analog for square tiling, von Neumann neighborhood), A016922 (analog for square tiling, Moore neighborhood), A016923 (analog for cubic 3D tiling, Moore neighborhood), A064762.

Programs

  • Mathematica
    hexgro[t_]:=7+4*6+5*6*(t-2)+Sum[i*6*7,{i,t-2}]; Table[hexgro[n],{n,40}]
    LinearRecurrence[{3,-3,1},{1,31,103},40] (* Harvey P. Dale, Apr 23 2020 *)
  • PARI
    Vec(x*(1 + 28*x + 13*x^2) / (1 - x)^3 + O(x^60)) \\ Colin Barker, Jun 28 2017

Formula

G.f.: x*(1 + 28*x + 13*x^2) / (1 - x)^3. - Colin Barker, Jun 28 2017
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>3. - Colin Barker, Jul 29 2017

Extensions

New Name from Omar E. Pol, Jun 25 2017