A298036 -id:A298036 - cp's OEIS frontend

A008574 a(0) = 1, thereafter a(n) = 4n.

1, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 128, 132, 136, 140, 144, 148, 152, 156, 160, 164, 168, 172, 176, 180, 184, 188, 192, 196, 200, 204, 208, 212, 216, 220, 224, 228, 232

Offset: 0

N. J. A. Sloane; entry revised Aug 24 2014

Number of squares on the perimeter of an (n+1) X (n+1) board. - Jon Perry, Jul 27 2003
Coordination sequence for square lattice (or equivalently the planar net 4.4.4.4).
Apparently also the coordination sequence for the planar net 3.4.6.4. - Darrah Chavey, Nov 23 2014
From N. J. A. Sloane, Nov 26 2014: (Start)
I confirm that this is indeed the coordination sequence for the planar net 3.4.6.4. The points at graph distance n from a fixed point in this net essentially lie on a hexagon (see illustration in link).
If n = 3k, k >= 1, there are 2k + 1 nodes on each edge of the hexagon. This counts the corners of the hexagon twice, so the number of points in the shell is 6(2k + 1) - 6 = 4n. If n = 3k + 1, the numbers of points on the six edges of the hexagon are 2k + 2 (4 times) and 2k + 1 (twice), for a total of 12k + 10 - 6 = 4n. If n = 3k + 2 the numbers are 2k + 2 (4 times) and 2k + 3 twice, and again we get 4n points.
The illustration shows shells 0 through 12, as well as the hexagons formed by shells 9 (green, 36 points), 10 (black, 40 points), 11 (red, 44 points), and 12 (blue, 48 points).
It is clear from the net that this period-3 structure continues forever, and establishes the theorem.
In contrast, for the 4.4.4.4 planar net, the successive shells are diamonds instead of hexagons, and again the n-th shell (n > 0) contains 4n points.
Of course the two nets are very different, since 4.4.4.4 has the symmetry of the square, while 3.4.6.4 has only mirror symmetry (with respect to a point), and has the symmetry of a regular hexagon with respect to the center of any of the 12-gons. (End)
Also the coordination sequence for a 6.6.6.6 point in the 3-transitive tiling {4.6.6, 6.6.6, 6.6.6.6}, see A265045, A265046. - N. J. A. Sloane, Dec 27 2015
Also the coordination sequence for 2-dimensional cyclotomic lattice Z[zeta_4].
Susceptibility series H_1 for 2-dimensional Ising model (divided by 2).
Also the Engel expansion of exp^(1/4); cf. A006784 for the Engel expansion definition. - Benoit Cloitre, Mar 03 2002
This sequence differs from A008586, multiples of 4, only in its initial term. - Alonso del Arte, Apr 14 2011
Number of 2 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00,0), (00;1) and (10;1). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1 < i2 and j1 < j2 and these elements are in same relative order as those in the triple (x,y,z). - Sergey Kitaev, Nov 11 2004
Central terms of the triangle in A118013. - Reinhard Zumkeller, Apr 10 2006
Also the coordination sequence for the htb net. - N. J. A. Sloane, Mar 31 2018
This is almost certainly also the coordination sequence for Dual(3.3.4.3.4) with respect to a tetravalent node. - Tom Karzes, Apr 01 2020
Minimal number of segments (equivalently, corners) in a rook circuit of a 2n X 2n board (maximal number is A085622). - Ruediger Jehn, Jan 02 2021

			From _Omar E. Pol_, Aug 20 2011 (Start):
Illustration of initial terms as perimeters of squares (cf. Perry's comment above):
.                                         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
.
. 1    4      8        12         16           20
(End)

T. D. Noe, Table of n, a(n) for n = 0..1000
Joerg Arndt, The 3.4.6.4 net
Matthias Beck and Serkan Hosten, Cyclotomic polytopes and growth series of cyclotomic lattices, arXiv:math/0508136 [math.CO], 2005-2006.
Pierre de la Harpe, On the prehistory of growth of groups, arXiv:2106.02499 [math.GR], 2021.
Jean-Guillaume Eon, Symmetry and Topology: The 11 Uninodal Planar Nets Revisited, Symmetry, 10 (2018), 13 pages, doi:10.3390/sym10020035. See Section 7.
Brian Galebach, k-uniform tilings (k <= 6) and their A-numbers
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also on arXiv, arXiv:1803.08530 [math.CO], 2018-2019.
Rostislav Grigorchuk and Cosmas Kravaris, On the growth of the wallpaper groups, arXiv:2012.13661 [math.GR], 2020. See section 4.2 p. 20.
Branko Grünbaum and Geoffrey C. Shephard, Tilings by regular polygons, Mathematics Magazine, 50 (1977), 227-247.
A. J. Guttmann, Indicators of solvability for lattice models, Discrete Math., 217 (2000), 167-189.
D. Hansel et al., Analytical properties of the anisotropic cubic Ising model, J. Stat. Phys., 48 (1987), 69-80.
Tom Karzes, Tiling Coordination Sequences
Sergey Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.
Reticular Chemistry Structure Resource, sql and htb
Anton Shutov and Andrey Maleev, Coordination sequences of 2-uniform graphs, Z. Kristallogr., 235 (2020), 157-166. See supplementary material, krb, vertex u_1.
N. J. A. Sloane, Illustration of points in shells 0 through 12 of the 3.4.6.4 planar net (see Comments for discussion)
N. J. A. Sloane, The uniform planar nets and their A-numbers [Annotated scanned figure from Gruenbaum and Shephard (1977)]
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, Part I, Part 2, Slides. (Mentions this sequence)
Michael Somos, Rational Function Multiplicative Coefficients
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A001844 (partial sums), A008586, A054275, A054410, A054389, A054764.
Convolution square of A040000.
Row sums of A130323 and A131032.
List of coordination sequences for uniform planar nets: A008458 (the planar net 3.3.3.3.3.3), A008486 (6^3), A008574 (4.4.4.4 and 3.4.6.4), A008576 (4.8.8), A008579(3.6.3.6), A008706 (3.3.3.4.4), A072154 (4.6.12), A219529(3.3.4.3.4), A250120 (3.3.3.3.6), A250122 (3.12.12).
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.
Coordination sequences for the 20 2-uniform tilings in the order in which they appear in the Galebach catalog, together with their names in the RCSR database (two sequences per tiling): #1 krt A265035, A265036; #2 cph A301287, A301289; #3 krm A301291, A301293; #4 krl A301298, A298024; #5 krq A301299, A301301; #6 krs A301674, A301676; #7 krr A301670, A301672; #8 krk A301291, A301293; #9 krn A301678, A301680; #10 krg A301682, A301684; #11 bew A008574, A296910; #12 krh A301686, A301688; #13 krf A301690, A301692; #14 krd A301694, A219529; #15 krc A301708, A301710; #16 usm A301712, A301714; #17 krj A219529, A301697; #18 kre A301716, A301718; #19 krb A301720, A301722; #20 kra A301724, A301726.
See also A265045, A265046.

a008574 0 = 1; a008574 n = 4 * n
a008574_list = 1 : [4, 8 ..]  -- Reinhard Zumkeller, Apr 16 2015

f[0] = 1; f[n_] := 4 n; Array[f, 59, 0] (* or *)
CoefficientList[ Series[(1 + x)^2/(1 - x)^2, {x, 0, 58}], x] (* Robert G. Wilson v, Jan 02 2011 *)
Join[{1},Range[4,232,4]] (* Harvey P. Dale, Aug 19 2011 *)
a[ n_] := 4 n + Boole[n == 0]; (* Michael Somos, Jan 07 2019 *)

{a(n) = 4*n + !n}; /* Michael Somos, Apr 16 2007 */

Binomial transform is A000337 (dropping the 0 there). - Paul Barry, Jul 21 2003
Euler transform of length 2 sequence [4, -2]. - Michael Somos, Apr 16 2007
G.f.: ((1 + x) / (1 - x))^2. E.g.f.: 1 + 4*x*exp(x). - Michael Somos, Apr 16 2007
a(-n) = -a(n) unless n = 0. - Michael Somos, Apr 16 2007
G.f.: exp(4*atanh(x)). - Jaume Oliver Lafont, Oct 20 2009
a(n) = a(n-1) + 4, n > 1. - Vincenzo Librandi, Dec 31 2010
a(n) = A005408(n-1) + A005408(n), n > 1. - Ivan N. Ianakiev, Jul 16 2012
a(n) = 4*n = A008586(n), n >= 1. - Tom Karzes, Apr 01 2020

A008486 Expansion of (1 + x + x^2)/(1 - x)^2.

Original entry on oeis.org

1, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 33, 36, 39, 42, 45, 48, 51, 54, 57, 60, 63, 66, 69, 72, 75, 78, 81, 84, 87, 90, 93, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 135, 138, 141, 144, 147, 150, 153, 156, 159, 162, 165, 168, 171, 174, 177, 180, 183, 186

Offset: 0

N. J. A. Sloane

Also the Engel expansion of exp^(1/3); cf. A006784 for the Engel expansion definition. - Benoit Cloitre, Mar 03 2002
Coordination sequence for planar net 6^3 (the graphite net, or the graphene crystal) - that is, the number of atoms at graph distance n from any fixed atom. Also for the hcb or honeycomb net. - N. J. A. Sloane, Jan 06 2013, Mar 31 2018
Coordination sequence for 2-dimensional cyclotomic lattice Z[zeta_3].
Conjecture: This is also the maximum number of edges possible in a planar simple graph with n+2 vertices. - Dmitry Kamenetsky, Jun 29 2008
The conjecture is correct. Proof: For n=0 the theorem holds, the maximum planar graph has n+2=2 vertices and 1 edge. Now suppose that we have a connected planar graph with at least 3 vertices. If it contains a face that is not a triangle, we can add an edge that divides this face into two without breaking its planarity. Hence all maximum planar graphs are triangulations. Euler's formula for planar graphs states that in any planar simple graph with V vertices, E edges and F faces we have V+F-E=2. If all faces are triangles, then F=2E/3, which gives us E=3V-6. Hence for n>0 each maximum planar simple graph with n+2 vertices has 3n edges. - Michal Forisek, Apr 23 2009
a(n) = sum of natural numbers m such that n - 1 <= m <= n + 1. Generalization: If a(n,k) = sum of natural numbers m such that n - k <= m <= n + k (k >= 1) then a(n,k) = (k + n)*(k + n + 1)/2 = A000217(k+n) for 0 <= n <= k, a(n,k) = a(n-1,k) +2k + 1 = ((k + n - 1)*(k + n)/2) + 2k + 1 = A000217(k+n-1) +2k +1 for n >= k + 1 (see e.g. A008486). - Jaroslav Krizek, Nov 18 2009
a(n) = partial sums of A158799(n). Partial sums of a(n) = A005448(n). - Jaroslav Krizek, Dec 06 2009
Integers n dividing a(n) = a(n-1) - a(n-2) with initial conditions a(0)=0, a(1)=1 (see A128834 with offset 0). - Thomas M. Bridge, Nov 03 2013
a(n) is conjectured to be the number of polygons added after n iterations of the polygon expansions (type A, B, C, D & E) shown in the Ngaokrajang link. The patterns are supposed to become the planar Archimedean net 3.3.3.3.3.3, 3.6.3.6, 3.12.12, 3.3.3.3.6 and 4.6.12 respectively when n - > infinity. - Kival Ngaokrajang, Dec 28 2014
Number of reduced words of length n in Coxeter group on 3 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I. - Ray Chandler, Nov 21 2016
Conjecture: let m = n + 2, p is the polyhedron formed by the convex hull of m points, q is the number of quadrilateral faces of p (see the Wikipedia link below), and f(m) = a(n) - q. Then f(m) would be the solution of the Thompson problem for all m in 3-space. - Sergey Pavlov, Feb 03 2017
Also, sequence defined by a(0)=1, a(1)=3, c(0)=2, c(1)=4; and thereafter a(n) = c(n-1) + c(n-2), and c consists of the numbers missing from a (see A001651). - Ivan Neretin, Mar 28 2017

			G.f. = 1 + 3*x + 6*x^2 + 9*x^3 + 12*x^4 + 15*x^5 + 18*x^6 + 21*x^7 + 24*x^8 + ...
From _Omar E. Pol_, Aug 20 2011: (Start)
Illustration of initial terms as 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
.
. 1    3      6        9          12           15
(End)

J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939, p. 158.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
David Applegate, The movie version
M. Beck and S. Hosten, Cyclotomic polytopes and growth series of cyclotomic lattices, arXiv:math/0508136 [math.CO], 2005-2006.
Jean-Guillaume Eon, Algebraic determination of generating functions for coordination sequences in crystal structures, Acta Cryst. A58 (2002), 47-53.
Jean-Guillaume Eon, Symmetry and Topology: The 11 Uninodal Planar Nets Revisited, Symmetry, 10 (2018), 13 pages, doi:10.3390/sym10020035. See Section 5.
A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004. (See Table 5.)
Brian Galebach, k-uniform tilings (k <= 6) and their A-numbers
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also on arXiv, arXiv:1803.08530 [math.CO], 2018-2019.
Rostislav Grigorchuk and Cosmas Kravaris, On the growth of the wallpaper groups, arXiv:2012.13661 [math.GR], 2020. See section 4.3 p. 20.
Branko Grünbaum and Geoffrey C. Shephard, Tilings by regular polygons, Mathematics Magazine, 50 (1977), 227-247.
Tom Karzes, Tiling Coordination Sequences
Kival Ngaokrajang, Illustration of polygon expansions (planar net)
Reticular Chemistry Structure Resource, hcb
N. J. A. Sloane, The uniform planar nets and their A-numbers [Annotated scanned figure from Gruenbaum and Shephard (1977)]
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
University of Manchester, Graphene
Wikipedia, Thomson problem
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Partial sums give A005448.
List of coordination sequences for uniform planar nets: A008458 (the planar net 3.3.3.3.3.3), A008486 (6^3), A008574(4.4.4.4 and 3.4.6.4), A008576 (4.8.8), A008579(3.6.3.6), A008706 (3.3.3.4.4), A072154 (4.6.12), A219529(3.3.4.3.4), A250120 (3.3.3.3.6), A250122 (3.12.12).
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.
Cf. A000217, A001651, A005448, A006784, A008585, A022424, A113062, A128834, A139250, A158799.

a008486 0 = 1; a008486 n = 3 * n
a008486_list = 1 : [3, 6 ..]  -- Reinhard Zumkeller, Apr 17 2015

[0^n+3*n: n in [0..90] ]; // Vincenzo Librandi, Aug 21 2011

CoefficientList[Series[(1 + x + x^2) / (1 - x)^2, {x, 0, 80}], x] (* Vincenzo Librandi, Nov 23 2014 *)
a[ n_] := If[ n == 0, 1, 3 n]; (* Michael Somos, Apr 17 2015 *)

{a(n) = if( n==0, 1, 3 * n)}; /* Michael Somos, May 05 2015 */

a(0) = 1; a(n) = 3*n = A008585(n), n >= 1.
Euler transform of length 3 sequence [3, 0, -1]. - Michael Somos, Aug 04 2009
a(n) = a(n-1) + 3 for n >= 2. - Jaroslav Krizek, Nov 18 2009
a(n) = 0^n + 3*n. - Vincenzo Librandi, Aug 21 2011
a(n) = -a(-n) unless n = 0. - Michael Somos, May 05 2015
E.g.f.: 1 + 3*exp(x)*x. - Stefano Spezia, Aug 07 2022

A008458 Coordination sequence for hexagonal lattice.

Original entry on oeis.org

1, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60, 66, 72, 78, 84, 90, 96, 102, 108, 114, 120, 126, 132, 138, 144, 150, 156, 162, 168, 174, 180, 186, 192, 198, 204, 210, 216, 222, 228, 234, 240, 246, 252, 258, 264, 270, 276, 282, 288, 294, 300, 306, 312, 318, 324, 330, 336, 342, 348

Offset: 0

N. J. A. Sloane

The hexagonal lattice is the familiar 2-dimensional lattice in which each point has 6 neighbors. This is sometimes called the triangular lattice. It is also the planar net 3.3.3.3.3.3.
Coordination sequence for 2-dimensional cyclotomic lattice Z[zeta_6].
Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 20 ).
Also the Engel expansion of exp^(1/6); cf. A006784 for the Engel expansion definition. - Benoit Cloitre, Mar 03 2002
Numbers k such that k+floor(k/2) | k*floor(k/2). - Wesley Ivan Hurt, Dec 01 2020

			From _Omar E. Pol_, Aug 20 2011: (Start)
Illustration of initial terms:
.                                             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
. 1             o o o       o       o       o           o
.       6                    o o o o         o         o
.                 12                          o o o o o
.                               18
.                                                 24
(End)
G.f. = 1 + 6*x + 12*x^2 + 18*x^3 + 24*x^4 + 30*x^5 + 36*x^6 + 42*x^7 + 48*x^8 + 54*x^9 + ...

T. D. Noe, Table of n, a(n) for n = 0..1000
M. Beck and S. Hosten, Cyclotomic polytopes and growth series of cyclotomic lattices, arXiv:math/0508136 [math.CO], 2005-2006.
J. H. Conway and N. J. A. Sloane, Low-Dimensional Lattices VII: Coordination Sequences, Proc. Royal Soc. London, A453 (1997), 2369-2389 (pdf).
Brian Galebach, k-uniform tilings (k <= 6) and their A-numbers
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also on arXiv, arXiv:1803.08530 [math.CO], 2018-2019.
Rostislav Grigorchuk and Cosmas Kravaris, On the growth of the wallpaper groups, arXiv:2012.13661 [math.GR], 2020. See section 4.1 p. 19.
Branko Grünbaum and Geoffrey C. Shephard, Tilings by regular polygons, Mathematics Magazine, 50 (1977), 227-247.
Tom Karzes, Tiling Coordination Sequences
G. Nebe and N. J. A. Sloane, Home page for hexagonal (or triangular) lattice A2
Reticular Chemistry Structure Resource, hxl
N. J. A. Sloane, The uniform planar nets and their A-numbers [Annotated scanned figure from Gruenbaum and Shephard (1977)]
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N))
William A. Stein, The modular forms database
Index entries for sequences related to A2 = hexagonal = triangular lattice
Index entries for linear recurrences with constant coefficients, signature (2,-1).
Index entries for coordination sequences

Essentially the same as A008588.
List of coordination sequences for uniform planar nets: A008458 (the planar net 3.3.3.3.3.3), A008486 (6^3), A008574(4.4.4.4 and 3.4.6.4), A008576 (4.8.8), A008579(3.6.3.6), A008706 (3.3.3.4.4), A072154 (4.6.12), A219529(3.3.4.3.4), A250120 (3.3.3.3.6), A250122 (3.12.12).
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.
Cf. A032528. - Omar E. Pol, Aug 20 2011
Cf. A048477 (binomial Transf.)

[0^n+6*n: n in [0..60] ]; // Vincenzo Librandi, Aug 21 2011

Maple
```
1, seq(6*n, n=1..65);
```

Join[{1},6*Range[60]] (* Harvey P. Dale, Jul 21 2013 *)
a[ n_] := Boole[n == 0] + 6 n; (* Michael Somos, May 21 2015 *)

makelist(if n=0 then 1 else 6*n,n,0,65); /* Martin Ettl, Nov 12 2012 */

PARI
```
{a(n) = 6*n + (!n)};
```

[6*n+int(n==0) for n in range(66)] # G. C. Greubel, May 25 2023

G.f.: (1 + 4*x + x^2)/(1 - x)^2.
a(n) = A003215(n) - A003215(n-1), n > 0.
Equals binomial transform of [1, 5, 1, -1, 1, -1, 1, ...]. - Gary W. Adamson, Jul 08 2008
G.f.: Hypergeometric2F1([3,-2], [1], -x/(1-x)). - Paul Barry, Sep 18 2008
a(n) = 0^n + 6*n. - Vincenzo Librandi, Aug 21 2011
n*a(1) + (n-1)*a(2) + (n-2)*a(3) + ... + 2*a(n-1) + a(n) = n^3. - Warren Breslow, Oct 28 2013
E.g.f.: 1 + 6*x*exp(x). - Stefano Spezia, Jun 26 2022

A298024 Expansion of (x^4+3x^3+6x^2+3x+1)/((1-x)(1-x^3)).

Original entry on oeis.org

1, 4, 10, 14, 18, 24, 28, 32, 38, 42, 46, 52, 56, 60, 66, 70, 74, 80, 84, 88, 94, 98, 102, 108, 112, 116, 122, 126, 130, 136, 140, 144, 150, 154, 158, 164, 168, 172, 178, 182, 186, 192, 196, 200, 206, 210, 214, 220, 224, 228, 234, 238, 242, 248, 252, 256, 262

Offset: 0

N. J. A. Sloane, Jan 21 2018

Coordination sequence for Dual(3^3.4^2) tiling with respect to a tetravalent node. This tiling is also called the prismatic pentagonal tiling, or the cem-d net. It is one of the 11 Laves tilings. (The identification of this coordination sequence with the g.f. in the definition was first conjectured by Colin Barker, Jan 22 2018.)
Also, coordination sequence for a tetravalent node in the "krl" 2-D tiling (or net).
Both of these identifications are easily established using the "coloring book" method - see the Goodman-Strauss & Sloane link.
For n>0, this is twice A047386 (numbers congruent to 0 or +-2 mod 7).
Linear recurrence and g.f. confirmed by Shutov/Maleev link. - Ray Chandler, Aug 31 2023

Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987. See Table 2.2.1, page 66, 3rd row, second tiling. (For the krl tiling.)
B. Gruenbaum and G. C. Shephard, Tilings and Patterns, W. H. Freeman, New York, 1987. See p. 96. (For the Dual(3^3.4^2) tiling.)

Rémy Sigrist, Table of n, a(n) for n = 0..1000
Chung, Ping Ngai, Miguel A. Fernandez, Yifei Li, Michael Mara, Frank Morgan, Isamar Rosa Plata, Niralee Shah, Luis Sordo Vieira, and Elena Wikner. Isoperimetric Pentagonal Tilings, Notices of the AMS 59, no. 5 (2012), pp. 632-640. See Fig. 1 (right).
Brian Galebach, Collection of n-Uniform Tilings. See Number 4 from the list of 20 2-uniform tilings.
Brian Galebach, k-uniform tilings (k <= 6) and their A-numbers
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also arXiv preprint, arXiv:1803.08530 [math.CO], 2018-2019.
Tom Karzes, Tiling Coordination Sequences
Frank Morgan, Optimal Pentagonal Tilings, Video, May 2021. [Mentions this tiling]
Reticular Chemistry Structure Resource (RCSR), The cem-d tiling (or net)
Reticular Chemistry Structure Resource (RCSR), The krl tiling (or net)
Anton Shutov and Andrey Maleev, Coordination sequences of 2-uniform graphs, Z. Kristallogr., 235 (2020), 157-166. See supplementary material, krb, vertex u_1.
Rémy Sigrist, Illustration of initial terms
Rémy Sigrist, PARI program for A298024
N. J. A. Sloane, Illustration of initial terms [1 (black), 4 (black), 10 (black), 14 (red)]
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
Index entries for linear recurrences with constant coefficients, signature (1,0,1,-1).

Cf. A301298.
See A298025 for partial sums, A298022 for a trivalent node.
See also A047486.
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.
Coordination sequences for the 20 2-uniform tilings in the order in which they appear in the Galebach catalog, together with their names in the RCSR database (two sequences per tiling): #1 krt A265035, A265036; #2 cph A301287, A301289; #3 krm A301291, A301293; #4 krl A301298, A298024; #5 krq A301299, A301301; #6 krs A301674, A301676; #7 krr A301670, A301672; #8 krk A301291, A301293; #9 krn A301678, A301680; #10 krg A301682, A301684; #11 bew A008574, A296910; #12 krh A301686, A301688; #13 krf A301690, A301692; #14 krd A301694, A219529; #15 krc A301708, A301710; #16 usm A301712, A301714; #17 krj A219529, A301697; #18 kre A301716, A301718; #19 krb A301720, A301722; #20 kra A301724, A301726.

CoefficientList[Series[(x^4+3x^3+6x^2+3x+1)/((1-x)(1-x^3)),{x,0,60}],x] (* or *) LinearRecurrence[{1,0,1,-1},{1,4,10,14,18},80] (* Harvey P. Dale, Oct 03 2018 *)

PARI
```
See Links section.
```

a(n) = a(n-1) + a(n-3) - a(n-4) for n>4. (Conjectured, correctly, by Colin Barker, Jan 22 2018.)

More terms from Rémy Sigrist, Jan 21 2018

Entry revised by N. J. A. Sloane, Mar 25 2018

A022144 Coordination sequence for root lattice B_2.

Original entry on oeis.org

1, 8, 16, 24, 32, 40, 48, 56, 64, 72, 80, 88, 96, 104, 112, 120, 128, 136, 144, 152, 160, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 312, 320, 328, 336, 344, 352, 360

Offset: 0

Michael Baake (mbaake(AT)sunelc3.tphys.physik.uni-tuebingen.de)

Equivalently, the coordination sequence for a point of degree 8 in the tiling of the Euclidean plane by right triangles (with angles Pi/2, Pi/4, Pi/4). These triangles are fundamental regions for the Coxeter group (2,4,4). In the notation of Conway et al. 2008 this is the tiling *442. The coordination sequence for a point of degree 4 is given by A234275. - N. J. A. Sloane, Dec 28 2015
Number of points of L_infinity norm n in the simple square lattice Z^2. - N. J. A. Sloane, Apr 15 2008
Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 24 ).
Number of 4 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (00;1), (01;0), (11;0) and (01;1). An occurrence of a ranpp (xy;z) in a matrix A=(a(i,j)) is a triple (a(i1,j1), a(i1,j2), a(i2,j1)) where i1Sergey Kitaev, Nov 11 2004
These numbers correspond to the number of primes in the shells of a prime spiral. In a(2) there are 8 primes surrounding 2 in a prime spiral. - Enoch Haga, Apr 06 2000

			1 + 8*x + 16*x^2 + 24*x^3 + 32*x^4 + 40*x^5 + 48*x^6 + 56*x^7 + ...

J. H. Conway et al., The Symmetries of Things, Peters, 2008, p. 191.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
M. Baake and U. Grimm, Coordination sequences for root lattices and related graphs, arXiv:cond-mat/9706122, Zeit. f. Kristallographie, 212 (1997), 253-256.
R. Bacher, P. de la Harpe and B. Venkov, Séries de croissance et séries d'Ehrhart associées aux réseaux de racines, C. R. Acad. Sci. Paris, 325 (Series 1) (1997), 1137-1142.
Tom Karzes, Tiling Coordination Sequences
Sergey Kitaev, On multi-avoidance of right angled numbered polyomino patterns, Integers: Electronic Journal of Combinatorial Number Theory 4 (2004), A21, 20pp.
Sergey Kitaev, On multi-avoidance of right angled numbered polyomino patterns, University of Kentucky Research Reports (2004).
Joan Serra-Sagrista, Enumeration of lattice points in l_1 norm, Inf. Proc. Lett. 76 (1-2) (2000) 39-44.
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N))
William A. Stein, The modular forms database
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Apart from initial term, the same as A008590.
Cf. A234275.
For partial sums see A016754.
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.

[0^n+8*n: n in [0..50] ]; // Vincenzo Librandi, Aug 21 2011

Join[{1}, LinearRecurrence[{2, -1}, {8, 16}, 50]] (* Jean-François Alcover, Jan 07 2019 *)

def A022144(n): return n<<3 if n else 1 # Chai Wah Wu, Mar 11 2025

a(n) = [x^(2*n)] ((1 + x)/(1 - x))^2.
G.f. for coordination sequence of B_n lattice: Sum_{i=0..n} binomial(2*n+1, 2*i)*z^i - 2*n*z*(1+z)^(n-1)/(1-z)^n. [Bacher et al.]
a(n) = (2*n+1)^2 - (2*n-1)^2. Binomial transform of [1, 7, 1, -1, 1, -1, 1, ...]. - Gary W. Adamson, Dec 27 2007
a(n) = 0^n + 8*n. - Vincenzo Librandi, Aug 21 2011
G.f.: 1 + 8*x/(1-x)^2. - R. J. Mathar, Feb 16 2018
Sum_{i=0..n} a(i) = (2*n+1)^2 = A016754(n). - Chunqing Liu, Jan 12 2020
E.g.f.: 1 + 8*x*exp(x). - Stefano Spezia, Apr 05 2021

A019557 Coordination sequence for G_2 lattice.

Original entry on oeis.org

1, 12, 30, 48, 66, 84, 102, 120, 138, 156, 174, 192, 210, 228, 246, 264, 282, 300, 318, 336, 354, 372, 390, 408, 426, 444, 462, 480, 498, 516, 534, 552, 570, 588, 606, 624, 642, 660, 678, 696, 714, 732, 750, 768, 786, 804, 822, 840, 858, 876, 894, 912, 930, 948, 966, 984, 1002, 1020, 1038, 1056

Offset: 0

Michael Baake (mbaake(AT)sunelc3.tphys.physik.uni-tuebingen.de)

Also, coordination sequence of Dual(3.12.12) tiling with respect to a 12-valent node. - N. J. A. Sloane, Jan 22 2018

For n > 1, also the number of minimum vertex colorings of the n-Andrásfai graph. - Eric W. Weisstein, Mar 03 2024

			From _Peter M. Chema_, Mar 20 2016: (Start)
Illustration of initial terms:
                                                       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
                                                       o
     1           12                30                 48
Compare to A003154, A045946, and A270700. (End)

Michael Baake and Uwe Grimm, Coordination sequences for root lattices and related graphs, arXiv:cond-mat/9706122, Zeit. f. Kristallographie, 212 (1997), pp. 253-256
Roland Bacher, Pierre de la Harpe, and Boris Venkov, Séries de croissance et séries d'Ehrhart associées aux réseaux de racines, C. R. Acad. Sci. Paris, 325 (Séries 1) (1997), pp. 1137-1142.
Roland Bacher, Pierre de la Harpe, and Boris Venkov, Séries de croissance et séries d'Ehrhart associées aux réseaux de racines, Annales de l'institut Fourier, 49 no. 3 (1999), pp. 727-762.
Tom Karzes, Tiling Coordination Sequences.
N. J. A. Sloane, Illustration of layers 0,1,2 in the graph of the Dual(3.12.12) tiling. Centered at a 12-valent node. Note that some of the blue edges are not part of the underlying graph.
N. J. A. Sloane, Overview of coordination sequences of Laves tilings. [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
Eric Weisstein's World of Mathematics, Andrásfai Graph.
Eric Weisstein's World of Mathematics, Minimum Vertex Coloring.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A000290, A003154, A008706, A016789, A045946, A270700.
For partial sums see A082040.
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.

CoefficientList[Series[(1 + 10 x + 7 x^2)/(1 - x)^2, {x, 0, 59}], x] (* Michael De Vlieger, Mar 21 2016 *)

my(x='x+O('x^100)); Vec((1+10*x+7*x^2)/(1-x)^2) \\ Altug Alkan, Mar 20 2016

a(n) = 18*n - 6, n >= 1.
G.f.: (1 + 10*x + 7*x^2)/(1-x)^2.
From Elmo R. Oliveira, Apr 04 2025: (Start)
E.g.f.: 6*exp(x)*(3*x - 1) + 7.
a(n) = 6*A016789(n-1) for n >= 1.
a(n) = 2*a(n-1) - a(n-2) for n >= 3. (End)

A296368 Coordination sequence for the Cairo or dual-3.3.4.3.4 tiling with respect to a trivalent point.

Original entry on oeis.org

1, 3, 8, 12, 15, 20, 25, 28, 31, 36, 41, 44, 47, 52, 57, 60, 63, 68, 73, 76, 79, 84, 89, 92, 95, 100, 105, 108, 111, 116, 121, 124, 127, 132, 137, 140, 143, 148, 153, 156, 159, 164, 169, 172, 175, 180, 185, 188, 191, 196, 201, 204, 207, 212, 217, 220, 223, 228

Offset: 0

N. J. A. Sloane, Dec 21 2017

There are two types of point in this tiling. This is the coordination sequence with respect to a point of degree 3.

The coordination sequence with respect to a point of degree 4 (see second illustration) is simply 1, 4, 8, 12, 16, 20, ..., the same as the coordination sequence for the 4.4.4.4 square grid (A008574). See the CGS-NJAS link for the proof.

Branko Grünbaum and G. C. Shephard, Tilings and Patterns. W. H. Freeman, New York, 1987. See Fig. 9.1.3, drawing P_5-24, page 480.
Herbert C. Moore, U.S. Patents 928,320 and 928,321, Patented July 20 1909. [Shows Cairo tiling.]

Rémy Sigrist, Table of n, a(n) for n = 0..1000
Chaim Goodman-Strauss and N. J. A. Sloane, A portion of the Cairo tiling
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also arXiv:1803.08530.
Chung, Ping Ngai, Miguel A. Fernandez, Yifei Li, Michael Mara, Frank Morgan, Isamar Rosa Plata, Niralee Shah, Luis Sordo Vieira, and Elena Wikner. Isoperimetric Pentagonal Tilings, Notices of the AMS 59, no. 5 (2012), pp. 632-640. See Fig. 1 (left).
Tom Karzes, Tiling Coordination Sequences
Frank Morgan, Optimal Pentagonal Tilings, Video, May 2021 [Has much to say about the Cairo tiling]
Reticular Chemistry Structure Resource (RCSR), The mcm tiling (or net)
Rémy Sigrist, PARI program for A296368
N. J. A. Sloane, Illustration of initial terms (for a trivalent point)
N. J. A. Sloane, Illustration of initial terms of coordination sequence 1,4,8,12,... for a tetravalent point
N. J. A. Sloane, A tiling by rectangles which has the same graph and coordination sequences as the Cairo tiling (Seen on the streets of Piscataway, New Jersey, USA)
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
N. J. A. Sloane, Coordination Sequences, Planing Numbers, and Other Recent Sequences (II), Experimental Mathematics Seminar, Rutgers University, Jan 31 2019, Part I, Part 2, Slides. (Mentions this sequence)
Index entries for linear recurrences with constant coefficients, signature (2, -2, 2, -1).

For partial sums see A296909.
List of coordination sequences for uniform planar nets: A008458 (the planar net 3.3.3.3.3.3), A008486 (6^3), A008574 (4.4.4.4 and 3.4.6.4), A008576 (4.8.8), A008579 (3.6.3.6), A008706 (3.3.3.4.4), A072154 (4.6.12), A219529 (3.3.4.3.4), A250120 (3.3.3.3.6), A250122 (3.12.12).
List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.

Join[{1, 3, 8}, LinearRecurrence[{2, -2, 2, -1}, {12, 15, 20, 25}, 100]] (* Jean-François Alcover, Aug 05 2018 *)

PARI
```
\\ See Links section.
```

The simplest formula is: a(0)=1, a(1)=2, a(2)=8, and thereafter a(n) = 4n if n is odd, 4n - 1 if n == 0 (mod 4), and 4n+1 if n == 2 (mod 4). (See the CGS-NJAS link for proof. - N. J. A. Sloane, May 10 2018)
a(n + 4) = a(n) + 16 for any n >= 3. - Rémy Sigrist, Dec 23 2017 (See the CGS-NJAS link for a proof. - N. J. A. Sloane, Dec 30 2017)
G.f.: -(x^6-x^5-2*x^4-4*x^2-x-1)/((x^2+1)*(x-1)^2).
From Colin Barker, Dec 23 2017: (Start)
a(n) = (8*n - (-i)^n - i^n) / 2 for n>2, where i=sqrt(-1).
a(n) = 2*a(n-1) - 2*a(n-2) + 2*a(n-3) - a(n-4) for n>6.
(End)

Terms a(8)-a(20) and RCSR link from Davide M. Proserpio, Dec 22 2017

More terms from Rémy Sigrist, Dec 23 2017

A298035 Coordination sequence of Dual(3.12.12) tiling with respect to a trivalent node.

Original entry on oeis.org

1, 3, 21, 39, 57, 75, 93, 111, 129, 147, 165, 183, 201, 219, 237, 255, 273, 291, 309, 327, 345, 363, 381, 399, 417, 435, 453, 471, 489, 507, 525, 543, 561, 579, 597, 615, 633, 651, 669, 687, 705, 723, 741, 759, 777, 795, 813, 831, 849, 867, 885, 903, 921, 939, 957, 975, 993, 1011, 1029, 1047, 1065

Offset: 0

N. J. A. Sloane, Jan 22 2018

This tiling is sometimes called the triakis triangular tiling.

Colin Barker, Table of n, a(n) for n = 0..1000
Chaim Goodman-Strauss and N. J. A. Sloane, A Coloring Book Approach to Finding Coordination Sequences, Acta Cryst. A75 (2019), 121-134, also on NJAS's home page. Also on arXiv, arXiv:1803.08530 [math.CO], 2018-2019.
Tom Karzes, Tiling Coordination Sequences
N. J. A. Sloane, Illustration of initial terms (shows one 120-degree sector of graph).
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database]
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A019557 (12-valent node), A016790 (partial sums, provided its offset is changed).

List of coordination sequences for Laves tilings (or duals of uniform planar nets): [3,3,3,3,3.3] = A008486; [3.3.3.3.6] = A298014, A298015, A298016; [3.3.3.4.4] = A298022, A298024; [3.3.4.3.4] = A008574, A296368; [3.6.3.6] = A298026, A298028; [3.4.6.4] = A298029, A298031, A298033; [3.12.12] = A019557, A298035; [4.4.4.4] = A008574; [4.6.12] = A298036, A298038, A298040; [4.8.8] = A022144, A234275; [6.6.6] = A008458.

f3:=proc(n) if n=0 then 1 else 18*n-15; fi; end;
[seq(f3(n),n=0..80)];

Vec((1 + x + 16*x^2) / (1 - x)^2 + O(x^60)) \\ Colin Barker, Jan 22 2018

Theorem: a(0)=1; thereafter a(n) = 18*n-15. [Proof: Use the "coloring book" method described in the Goodman-Strauss & Sloane article.]
From Colin Barker, Jan 22 2018: (Start)
G.f.: (1 + x + 16*x^2) / (1 - x)^2.
a(n) = 2*a(n-1) - a(n-2) for n>2.
(End)

A298038 Coordination sequence of Dual(4.6.12) tiling with respect to a hexavalent node.

Original entry on oeis.org

1, 6, 24, 18, 48, 30, 72, 42, 96, 54, 120, 66, 144, 78, 168, 90, 192, 102, 216, 114, 240, 126, 264, 138, 288, 150, 312, 162, 336, 174, 360, 186, 384, 198, 408, 210, 432, 222, 456, 234, 480, 246, 504, 258, 528, 270, 552, 282, 576, 294, 600, 306, 624, 318, 648

Offset: 0

N. J. A. Sloane, Jan 22 2018

nonn

Conjecture: For n > 0, a(n)=12n if n even, otherwise 6n.
From Keagan Boyce, May 18 2024: (Start)
It appears that
  a(n) = (3*n)*(3+(-1)^n) for n > 0,
which would imply that for all even n > 0,
  a(n) = (3*n)*(3+(1)) = (3*n)*(4) = 12*n,
and for all odd n > 0,
  a(n) = (3*n)*(3+(-1)) = (3*n)*(2) = 6*n. (End)

Tom Karzes, Tiling Coordination Sequences.
N. J. A. Sloane, Illustration of initial terms (shows one 60-degree sector of tiling).
N. J. A. Sloane, Overview of coordination sequences of Laves tilings [Fig. 2.7.1 of Grünbaum-Shephard 1987 with A-numbers added and in some cases the name in the RCSR database].

Cf. A072154, A298039 (partial sums), A298036 (12-valent node), A298040 (tetravalent node).

Conjectures from Colin Barker, Apr 03 2020: (Start)
G.f.: (1 + 6*x + 22*x^2 + 6*x^3 + x^4) / ((1 - x)^2*(1 + x)^2).
a(n) = 2*a(n-2) - a(n-4) for n > 4. (End)

Terms a(8)-a(54) added by Tom Karzes, Apr 01 2020

cp's OEIS Frontend

A298037 Partial sums of A298036.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A008574 a(0) = 1, thereafter a(n) = 4n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A008486 Expansion of (1 + x + x^2)/(1 - x)^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A008458 Coordination sequence for hexagonal lattice.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Maxima

PARI

SageMath

Formula

A298024 Expansion of (x^4+3*x^3+6*x^2+3*x+1)/((1-x)*(1-x^3)).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A022144 Coordination sequence for root lattice B_2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

A298024 Expansion of (x^4+3x^3+6x^2+3x+1)/((1-x)(1-x^3)).