A063489 -id:A063489 - cp's OEIS frontend

A132366 Partial sum of centered tetrahedral numbers A005894.

1, 6, 21, 56, 125, 246, 441, 736, 1161, 1750, 2541, 3576, 4901, 6566, 8625, 11136, 14161, 17766, 22021, 27000, 32781, 39446, 47081, 55776, 65625, 76726, 89181, 103096, 118581, 135750, 154721, 175616, 198561, 223686, 251125, 281016, 313501, 348726, 386841

Offset: 0

Jonathan Vos Post, Nov 09 2007

From Robert A. Russell, Oct 09 2020: (Start)
a(n-1) is the number of achiral colorings of the 5 tetrahedral facets (or vertices) of a regular 4-dimensional simplex using n or fewer colors. An achiral arrangement is identical to its reflection. The 4-dimensional simplex is also called a 5-cell or pentachoron. Its Schläfli symbol is {3,3,3}.
There are 60 elements in the automorphism group of the 4-dimensional simplex that are not in its rotation group. Each is an odd permutation of the vertices and can be associated with a partition of 5 based on the conjugacy class of the permutation. The first formula for a(n-1) is obtained by averaging their cycle indices after replacing x_i^j with n^j according to the Pólya enumeration theorem.
  Partition  Count  Odd Cycle Indices
  41         30     x_1x_4^1
  32         20     x_2^1x_3^1
  2111       10     x_1^3x_2^1 (End)

Nathaniel Johnston, Table of n, a(n) for n = 0..5000
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000292, A005894, A063488, A001845, A063489, A005898, A063490, A057813, A063491, A005902, A063492, A005917, A063493, A063494, A063495, A063496.
Cf. A337895 (oriented), A000389(n+4) (unoriented), A000389 (chiral), A331353 (5-cell edges, faces), A337955 (8-cell vertices, 16-cell facets), A337958 (16-cell vertices, 8-cell facets), A338951 (24-cell), A338967 (120-cell, 600-cell).
a(n-1) = A325001(4,n).

Do[Print[n, " ", (n^4 + 4 n^3 + 11 n^2 + 14 n + 6)/6 ], {n, 0, 10000}]
Accumulate[Table[(2n+1)(n^2+n+3)/3,{n,0,40}]] (* or *) LinearRecurrence[ {5,-10,10,-5,1},{1,6,21,56,125},40] (* Harvey P. Dale, Feb 26 2020 *)

a(n) = (n^4 + 4*n^3 + 11*n^2 + 14*n + 6)/6 = (n^2+2*n+6)*(n+1)^2/6.
G.f.: -(x+1)*(x^2+1) / (x-1)^5. - Colin Barker, May 04 2013
From Robert A. Russell, Oct 09 2020: (Start)
a(n-1) = n^2 * (5 + n^2) / 6.
a(n-1) = binomial(n+4,5) - binomial(n,5) = A000389(n+4) - A000389(n).
a(n-1) = 1*C(n,1) + 4*C(n,2) + 6*C(n,3) + 4*C(n,4), where the coefficient of C(n,k) is the number of achiral colorings using exactly k colors.
a(n-1) = 2*A000389(n+4) - A337895(n) = A337895(n) - 2*A000389(n) .
G.f. for a(n-1): x * (x+1) * (x^2+1) / (1-x)^5. (End)
From Amiram Eldar, Feb 14 2023: (Start)
Sum_{n>=0} 1/a(n) = Pi^2/5 + 3/25 - 3*Pi*coth(sqrt(5)*Pi)/(5*sqrt(5)).
Sum_{n>=0} (-1)^n/a(n) = Pi^2/10 - 3/25 + 3*Pi*cosech(sqrt(5)*Pi)/(5*sqrt(5)). (End)
a(n) = A006007(n) + A006007(n+1) = A002415(n) + A002415(n+2). - R. J. Mathar, Jun 05 2025

Corrected offset, Mathematica program by Tomas J. Bulka (tbulka(AT)rodincoil.com), Sep 02 2009

A193218 Number of vertices in truncated tetrahedron with faces that are centered polygons.

Original entry on oeis.org

1, 21, 95, 259, 549, 1001, 1651, 2535, 3689, 5149, 6951, 9131, 11725, 14769, 18299, 22351, 26961, 32165, 37999, 44499, 51701, 59641, 68355, 77879, 88249, 99501, 111671, 124795, 138909, 154049, 170251, 187551, 205985, 225589, 246399, 268451, 291781, 316425

Offset: 1

Craig Ferguson, Jul 18 2011

The sequence starts with a central vertex and expands outward with (n-1) centered polygonal pyramids producing a truncated tetrahedron. Each iteration requires the addition of (n-2) edges and (n-1) vertices to complete the centered polygon in each face. For centered triangles see A005448 and centered hexagons A003215.
This sequence is the 18th in the series (1/12)*t*(2*n^3-3*n^2+n)+2*n-1 for t = 2, 4, 6, ... gives A049480, A005894, A063488, A001845, A063489, A005898, A063490, A057813, A063491, A005902, A063492, A005917, A063493, A063494, A063495, A063496 and t = 36. While adjusting for offsets, the beginning sequence A049480 is generated by adding the square pyramidal numbers A000330 to the odd numbers A005408 and each subsequent sequence is found by adding another set of square pyramidals A000330. (T/2) * A000330(n) + A005408(n). At 30 * A000330 + A005408 = centered dodecahedral numbers, 36 * A000330 + A005408 = A193228 truncated octahedron and 90 * A000330 + A005408 = A193248 = truncated icosahedron and dodecahedron. All five of the "Centered Platonic Solids" numbers sequences are in this series of sequences. Also 4 out of five of the "truncated" platonic solid number sequences are in this series. - Bruce J. Nicholson, Jul 06 2018
It would be good to have a detailed description of how the sequence is constructed. Maybe in the Examples section? - N. J. A. Sloane, Sep 07 2018

Vincenzo Librandi, Table of n, a(n) for n = 1..10000
OEIS, (Centered_polygons) pyramidal numbers
Wikipedia, Tetrahedral number
Wikipedia, Triangular number
Wikipedia, Centered polygonal number
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A260810 (partial sums).

[6*n^3-9*n^2+5*n-1: n in [1..40]]; // Vincenzo Librandi, Aug 30 2011

Table[6 n^3 - 9 n^2 + 5 n - 1, {n, 35}] (* Alonso del Arte, Jul 18 2011 *)
CoefficientList[Series[(1+x)*(x^2+16*x+1)/(1-x)^4, {x, 0, 50}], x] (* Stefano Spezia, Sep 04 2018 *)

a(n) = 6*n^3 - 9*n^2 + 5*n - 1.
G.f.: x*(1+x)*(x^2+16*x+1) / (1-x)^4. - R. J. Mathar, Aug 26 2011
a(n) = 18 * A000330(n-1) + A005408(n-1) = A063496(n) + A006331(n-1). - Bruce J. Nicholson, Jul 06 2018

A139594 Number of different n X n symmetric matrices with nonnegative entries summing to 4. Also number of symmetric oriented graphs with 4 arcs on n points.

Original entry on oeis.org

0, 1, 9, 39, 116, 275, 561, 1029, 1744, 2781, 4225, 6171, 8724, 11999, 16121, 21225, 27456, 34969, 43929, 54511, 66900, 81291, 97889, 116909, 138576, 163125, 190801, 221859, 256564, 295191, 338025, 385361, 437504, 494769, 557481, 625975, 700596

Offset: 0

Marc A. A. van Leeuwen, Jun 12 2008

a(n) is also the number of semistandard Young tableaux over all partitions of 4 with maximal element <= n. - Alois P. Heinz, Mar 22 2012

Starting from 1 the partial sums give A244864. - J. M. Bergot, Sep 17 2016

			From _Michael B. Porter_, Sep 18 2016: (Start)
The nine 2 X 2 matrices summing to 4 are:
4 0  3 0  2 0  1 0  0 0  2 1  1 1  0 1  0 2
0 0  0 1  0 2  0 3  0 4  1 0  1 1  1 2  2 0
(End)

Alois P. Heinz, Table of n, a(n) for n = 0..1000

For 3 in place of 4 this gives A005900.
Row n=4 of A210391. - Alois P. Heinz, Mar 22 2012
Partial sums of A063489.

dd := proc(n,m) coeftayl(1/((1-X)^m*(1-X^2)^binomial(m,2)),X=0,n); seq(dd(4,m),m=0..N);

gf[k_] := 1/((1-x)^k (1-x^2)^(k(k-1)/2));
T[n_, k_] := SeriesCoefficient[gf[k], {x, 0, n}];
a[k_] := T[4, k];
a /@ Range[0, 40] (* Jean-François Alcover, Nov 07 2020 *)

a(n) = coefficient of x^4 in 1/((1-x)^n * (1-x^2)^binomial(n,2)).

a(n) = (n^2*(7+5*n^2))/12. G.f.: x*(1+x)*(1+3*x+x^2)/(1-x)^5. [Colin Barker, Mar 18 2012]

A242941 a(n) is the number of convex uniform tessellations in dimension n.

Original entry on oeis.org

1, 11, 28, 143

Offset: 1

Felix Fröhlich, May 27 2014

Terms for n > 4 have not been determined so far. Alfredo Andreini in 1905 gave a value of 25 for a(3), later found to be incorrect. The value 28 for a(3) was given by Norman Johnson in 1991 and later in 1994 independently by Branko Grünbaum. The value for a(4) was given by George Olshevsky in 2006.
Deza and Shtogrin (2000) agree that the value of a(3) is 28, although the authors do not provide a proof. - Felix Fröhlich, Nov 29 2014
From Felix Fröhlich, Feb 03 2019: (Start)
The 11 convex uniform tilings are all illustrated in Kepler, 1619. For an argument that exactly 11 such tilings exist, see Grünbaum, Shephard, 1977.
In dimension 2, the definition of "uniform polytope" usually seems to be equivalent to the regular polygons in order to exclude polygons that alternate two different edge-lengths. Applying this principle retroactively to dimension 1 (as done, as I assume, by Coxeter, see Coxeter, 1973, p. 129) yields a(1) = 1. (End)

H. S. M. Coxeter, Regular Polytopes, Third Edition, Dover Publications, 1973, ISBN 9780486614809.
B. Grünbaum, Uniform tilings of 3-space, Geombinatorics, Vol. 4, No. 2 (1994), 49-56.
N. W. Johnson, Uniform Polytopes, [To appear, cf. Weiss, Stehle, 2017].

A. Andreini, Sulle reti di poliedri regolari e semiregolari e sulle correspondenti reto correlative [On the regular and semiregular nets of polyhedra and on the corresponding correlative nets], Mem. Società Italiana della Scienze, Ser.3, 14 (1905), 75-129.
M. Deza and M. Shtogrin, Uniform Partitions of 3-space, their Relatives and Embedding, European Journal of Combinatorics, Vol. 21, No. 6 (2000), 807-814.
B. Grünbaum and G. C. Shephard, Tilings by Regular Polygons, Mathematics Magazine, Vol. 50, No. 5 (1977), 227-247.
J. Kepler, Harmonices Mundi [The Harmony of the World] (1619).
G. Olshevsky, Uniform Panoploid Tetracombs (2006)
A. I. Weiss and E. M. Stehle, Norman W. Johnson (12 November 1930 to 13 July 2017), The Art of Discrete and Applied Mathematics, Vol. 1, No. 1 (2018).
Wikipedia, Convex uniform honeycomb
Wikipedia, List of convex uniform tilings

Cf. A068599.
List of coordination sequences for the 11 uniform 2D tilings: 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 the 28 uniform 3D tilings: cab: A299266, A299267; crs: A299268, A299269; fcu: A005901, A005902; fee: A299259, A299265; flu-e: A299272, A299273; fst: A299258, A299264; hal: A299274, A299275; hcp: A007899, A007202; hex: A005897, A005898; kag: A299256, A299262; lta: A008137, A299276; pcu: A005899, A001845; pcu-i: A299277, A299278; reo: A299279, A299280; reo-e:  A299281, A299282; rho: A008137, A299276; sod: A005893, A005894; sve: A299255, A299261; svh: A299283, A299284; svj: A299254, A299260; svk: A010001, A063489; tca: A299285, A299286; tcd: A299287, A299288; tfs: A005899, A001845; tsi: A299289, A299290; ttw: A299257, A299263; ubt: A299291, A299292; bnn: A007899, A007202. See the Proserpio link in A299266 for overview.

Edited by N. J. A. Sloane, Feb 15 2018

Edited by Felix Fröhlich, Feb 03-10 2019

cp's OEIS Frontend

A132366 Partial sum of centered tetrahedral numbers A005894.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A193218 Number of vertices in truncated tetrahedron with faces that are centered polygons.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A139594 Number of different n X n symmetric matrices with nonnegative entries summing to 4. Also number of symmetric oriented graphs with 4 arcs on n points.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A242941 a(n) is the number of convex uniform tessellations in dimension n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions