A182322 -id:A182322 - cp's OEIS frontend

A027610 The number of Apollonian networks (planar 3-trees) with n+3 vertices.

1, 1, 1, 3, 7, 24, 93, 434, 2110, 11002, 58713, 321776, 1792133, 10131027, 57949430, 334970205, 1953890318, 11489753730, 68054102361, 405715557048, 2433003221232, 14668536954744, 88869466378593, 540834155878536, 3304961537938269, 20273202069859769

Offset: 1

Gordon F. Royle

Previous name was: Number of chordal planar triangulations; also number of planar triangulations with maximal number of triangles; also number of graphs obtained from the tetrahedron by repeatedly inserting vertices of degree 3 into a triangular face; also number of uniquely 4-colorable planar graphs; also number of simplicial 3-clusters with n cells; also Apollonian networks with n+3 vertices.
Also arises in enumeration of spectral isomers of alkane systems (see Cyvin et al.). - N. J. A. Sloane, Aug 15 2006
Chordal planar triangulations: take planar triangulations on n nodes, divide them into classes according to how many triangles they contain (all have 2n-4 triangular faces but may have additional triangles); count triangulations in class with most triangles.
If mirror images are not taken as equivalent, A007173 is obtained instead. - Brendan McKay, Mar 08 2014
Number of unoriented polyominoes composed of n tetrahedral cells of the hyperbolic regular tiling with Schläfli symbol {3,3,oo}. For unoriented polyominoes, chiral pairs are counted as one. - Robert A. Russell, Mar 20 2024

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 1..200
L. W. Beineke and R. E. Pippert Enumerating dissectable polyhedra by their automorphism groups, Can. J. Math., 26 (1974), 50-67.
Allan Bickle, A Survey of Maximal k-degenerate Graphs and k-Trees, Theory and Applications of Graphs 0 1 (2024) Article 5.
CombOS - Combinatorial Object Server, generate planar graphs
S. J. Cyvin, Jianji Wang, J. Brunvoll, Shiming Cao, Ying Li, B. N. Cyvin, and Yugang Wang, Staggered conformers of alkanes: complete solution of the enumeration problem, J. Molec. Struct. 413-414 (1997), 227-239.
Paul Jungeblut, Edge Guarding Plane Graphs, Master Thesis, Karlsruhe Institute of Technology (Germany, 2019).
F. Hering et al., The enumeration of stack polytopes and simplicial clusters, Discrete Math., 40 (1982), 203-217.
Manfred Scheucher, Hendrik Schrezenmaier, Raphael Steiner, A Note On Universal Point Sets for Planar Graphs, arXiv:1811.06482 [math.CO], 2018.

Sum of A047776, A047775, A047774, A047773, A047762, A047760, A047758, A047754, A047753, A047752, A047751, A047771, A047769, A047766 (twice), A047765, A047764.

Cf. A007173 (oriented), A371350 (chiral), A371351 (achiral), A001764 (rooted), A000207 {3,oo}, A182322 {3,3,3,oo}.

A001764 := proc(m) RETURN((3*m)!/(m!*(2*m+1)!)); end; # Gives A001764(m)
A047749 := proc(m) local x; if m mod 2 = 1 then x := (m-1)/2; RETURN((3*x+1)!/((x+1)!*(2*x+1)!)); fi; RETURN(A001764(m/2)); end; # Gives A047749(m)
A027610 := proc(n) local N; N := 0; N := N + A001764(n)/(12*(n+1)); if n mod 2 = 0 then N := N + 5/24*A001764(n/2); fi; if (n-1) mod 3 = 0 then N := N + 1/3*A001764((n-1)/3); fi; if (n-1) mod 4 = 0 then N := N + 1/4*A001764((n-1)/4); fi;
if (n-2) mod 6 = 0 then N := N + 1/6*A001764((n-2)/6); fi; N := N + 3/8*A047749(n); if (2*n-1) mod 3 = 0 then N := N + 1/6*A047749((2*n-1)/3); fi; RETURN(N); end;

Table[Binomial[3 n, 2 n]/(6 (2 n + 1) (2 n + 2)) + If[EvenQ[n], 7 Binomial[3 n/2, n]/(12 (n + 1)), 3 Binomial[3 n/2 - 1/2, n]/(4 (n + 1))] + Switch[Mod[n, 3], 1, Binomial[n - 1, 2 n/3 - 2/3]/(2 n/3 + 1/3), 2, Binomial[n - 1, 2 n/3 - 1/3]/(2 n/3 + 2/3), , 0]/3 + If[1 == Mod[n,4], Binomial[3 n/4 - 3/4, n/2 - 1/2]/(n/2 + 1/2), 0]/4 + If[2 == Mod[n, 6], Binomial[n/2 - 1, n/3 - 2/3]/(n/3 + 1/3), 0]/6, {n, 1, 30}] (* _Robert A. Russell, Apr 11 2012 *)

T(m)={if(m<0||denominator(m)!=1,0,(3*m)!/(m!*(2*m+1)!))};
U(k)={if(k<0||denominator(k)!=1,0,if(k%2,my(m=(k-1)/2);(3*m+1)!/((m+1)!*(2*m+1)!),T(k/2)))};
S(n)=T(n)/(12*(n+1))+5*T(n/2)/24+T((n-1)/3)/3+T((n-1)/4)/4+T((n-2)/6)/6+3*U(n)/8+U((2*n-1)/3)/6;
for(k=1,26,print1(S(k),", ")) \\ Hugo Pfoertner, Mar 07 2020

From Robert A. Russell, Mar 20 2024: (Start)
a(n) = C(3n,n)/(6*(2n+1)*(2n+2)) + ([0==n mod 2]*7*C(3n/2,n) + [1==n mod 2]*9*C((3n-1)/2,n)) / (12(n+1)) + [1==n mod 3]*C(n-1,(n-1)/3)/(2n+1) + [2==n mod 3]*C(n-1,(n-2)/3)/(2n+2) + [1==n mod 4]*C((3n-3)/4,(n-1)/2)/(2n+2) + [2==n mod 6]*C(n/2-1,(n-2)/3)/(2n+2).
a(n) = A007173(n) - A371350(n) = (A007173(n) + A371351(n))/2 = A371350(n) + A371351(n).
a(n) = h(3,n) in Table 8 of Hering link.
G.f.: (-16 + 4*G(z) - 2*G(z)^2 + z*G(z)^4 + 14*G(z^2) + 9z*G(z^2)^2 + 8z*G(z^3) + 4z^2*G(z^3)^2 + 6z*G(z^4) + 4z^2*G(z^6))/24, where G(z) = 1 + z*G(z)^3 is the g.f. for A001764. (End)

One additional term from Robert A. Russell, Apr 11 2012
Noted the name "Apollonian network" by Brendan McKay, Mar 08 2014
New name from Allan Bickle, Feb 21 2024

A182299 Number of achiral simplicial 4-clusters with n cells.

Original entry on oeis.org

1, 1, 1, 3, 6, 20, 51, 184, 550, 2009, 6487, 23875, 81724, 302954, 1078409, 4034373, 14771551, 55789188, 208526682, 794933818, 3017839193, 11604938152, 44590911769, 172833268057, 670520982414, 2617397888002, 10234831661388, 40204487779050, 158254659096516, 625142808049902

Offset: 1

Robert A. Russell, Apr 23 2012

This sequence would be H_{4,n} subtracted from twice h_{4,n} in Table 8 of the Hering article if those numbers were correct, but some are not. In addition, the formula in the penultimate line of Table 5 of the article should not have an exponent for the second E_4.

The limit supremum as n approaches infinity of a(n+1)/a(n) is 16(2-sqrt(3)) or about 4.28719. - Robert A. Russell, Oct 21 2014

			For n=4 the a(4)=3 solutions are the three achiral (there are no chiral) clusters that can be formed from four simplexes in four-space.  One has three attached to a fourth, one has four sharing a common triangle, and the last has neither of these properties.

F. Hering et al., The enumeration of stack polytopes and simplicial clusters, Discrete Math., 40 (1982), 203-217.

Cf. A182322, A007175.

n = 30;
e[d_,t_]:=Sum[Binomial[d k,k]/((d-1)k+1)t^k,{k,0,n}]
CoefficientList[Series[(10e[4,t^2]e[2,e[4,t^2]t]^3t
   +30e[4,t^4]t(1+e[4,t^4]t)
   +20e[1,e[4,t^6] t^2]e[2,e[4,t^6]t^3]t)/60
   -(6(e[2,e[4,t^2]t]-1)^2+6e[4,t^4]^2t^2)/24
   +(4e[4,t^2]^4t^2+8e[1,e[4,t^6]t^2]e[4,t^6]t^2)/24,
   {t,0,n}]/t,t] (* Robert A. Russell, Apr 23 2012 *)

A369474 Number of chiral pairs of polyominoes composed of n pentachoral cells of the hyperbolic regular tiling with Schläfli symbol {3,3,3,oo}.

Original entry on oeis.org

0, 0, 0, 0, 1, 10, 80, 611, 4602, 34791, 265606, 2054034, 16094883, 127693729, 1024649237, 8306343347, 67952829212, 560471786912, 4656785469564, 38948533963500, 327715193729107, 2772468576820531

Offset: 1

Robert A. Russell, Mar 20 2024

nonn

Also number of chiral pairs of simplicial 4-clusters or stack polytopes with n pentachoral cells. Each member of a chiral pair is a reflection but not a rotation of the other. Some of the h(4,n) terms in the Hering article are in error, including the 6th, 8th and 9th.

F. Hering et al., The enumeration of stack polytopes and simplicial clusters, Discrete Math., 40 (1982), 203-217.

Cf. A007175 (oriented), A182322 (oriented), A182299 (achiral), A002293 (rooted), A371350 {3,3,oo}.

This is the half the difference of A007175 and A182299, both of which have Mathematica programs.

a(n) = A007175(n) - A182322(n) = (A007175(n) - A182299(n))/2 = A182322(n) - A182299(n).

a(n) = h(4,n) - H(4,n) in Table 8 of Hering link.

cp's OEIS Frontend

A007174 Erroneous version of A182322.

Views

Author

Keywords

A027610 The number of Apollonian networks (planar 3-trees) with n+3 vertices.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A182299 Number of achiral simplicial 4-clusters with n cells.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A369474 Number of chiral pairs of polyominoes composed of n pentachoral cells of the hyperbolic regular tiling with Schläfli symbol {3,3,3,oo}.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula