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

A323933 Erroneous version of A038142.

Original entry on oeis.org

1, 1, 2, 5, 12, 36, 116, 411, 1489, 5572, 21115, 81121
Offset: 1

Views

Author

Keywords

A018190 Number of planar simply-connected polyhexes (or benzenoid hydrocarbons) with n hexagons.

Original entry on oeis.org

1, 1, 3, 7, 22, 81, 331, 1435, 6505, 30086, 141229, 669584, 3198256, 15367577, 74207910, 359863778, 1751594643, 8553649747, 41892642772, 205714411986, 1012565172403, 4994807695197, 24687124900540, 122238208783203
Offset: 1

Views

Author

N. J. A. Sloane, Viviane Rochon (viviane(AT)crt.umontreal.ca), Gilles Caporossi (gillesc(AT)crt.umontreal.ca)

Keywords

References

  • J. Brunvoll, B. N. Cyvin, and S. J. Cyvin, Studies of some chemically relevant polygonal systems: mono-q-polyhexes, ACH Models in Chem., 133 (3) (1996), 277-298.

Crossrefs

Extensions

More terms from Joseph Myers, Nov 06 2003
Further terms added by N. J. A. Sloane from Brinkmann et al. (2003). Jun 04 2005

A131482 a(n) is the number of n-celled polyominoes with perimeter 2n+2.

Original entry on oeis.org

1, 1, 2, 4, 11, 27, 83, 255, 847, 2829, 9734, 33724, 118245, 416816, 1478602, 5267171, 18840144, 67611472, 243378415, 878407170, 3178068821, 11523323634, 41865833602, 152382134767
Offset: 1

Views

Author

Tanya Khovanova, Jul 27 2007

Keywords

Comments

2n+2 is the maximal perimeter of an n-celled polyomino. a(n) is the number of n-celled polyominoes that have a tree as their connectedness graph (vertices of this graph correspond to cells and two vertices are connected if the corresponding cells have a common edge).

Crossrefs

Cf. A000105, A057730. Diagonal of A342243.
A359522 counts only polyominoes with holes.
A002013 counts only unbranched polyominoes.
A038142 is the analog for polyhexes.

Formula

a(n) <= A000105(n), a(n) <= A057730(n+1).
a(n) >= A000602(n) [see comment on edge graph trees]. - R. J. Mathar, Mar 08 2021

Extensions

a(14)-a(16) from David Radcliffe, Dec 25 2017
a(17) from David Radcliffe, Dec 26 2017
a(18)-a(24) from John Mason, Dec 11 2021

A038143 Hexagonal cata-condensed helicenes with n cells (non-planar cata-fused benzenoid hydrocarbons).

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 5, 35, 200, 1121, 5919, 30509, 153187, 756825, 3688195
Offset: 1

Views

Author

Keywords

Crossrefs

Equals A002216-A038142. Cf. A018190.

Extensions

a(12)-a(15) from Andrey Zabolotskiy, Feb 16 2023

A323931 Unbranched catafusenes, mirror-symmetrical.

Original entry on oeis.org

0, 0, 1, 1, 4, 3, 12, 10, 34, 28, 97, 81, 271, 226, 764, 638, 2141, 1787, 6025, 5030, 16924, 14116, 47623, 39727, 133934, 111655, 377003, 314297, 1061064, 884199
Offset: 1

Views

Author

N. J. A. Sloane, Feb 09 2019

Keywords

Crossrefs

The main sequences listed in Table 1 of Balaban et al. (1988) are A323931, A323932, A003104, A323851, A038142.

Extensions

a(13)-a(30) from Cyvin, Brunvoll & Cyvin (Tables 14 & 15) added by Andrey Zabolotskiy, Feb 16 2023

A066331 Number of fixed hexagonal polyominoes with n cells and tree-like structure.

Original entry on oeis.org

1, 3, 9, 29, 99, 348, 1260, 4644, 17382, 65822, 251655, 969819, 3762517, 14680890, 57567228, 226712655, 896252850, 3555116583, 14144563158
Offset: 1

Views

Author

Jan Kristian Haugland, Jan 01 2002

Keywords

Crossrefs

Cf. A001207 (all polyhexes), A038142 (free tree-like).

Extensions

a(16)-a(19) from Sean A. Irvine, Oct 08 2023

A131488 a(n) is the number of polyhexes with n edges, including inner edges.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 2, 0, 0, 1, 1, 5, 0, 1, 3, 6, 12, 3, 4, 14, 26, 39, 10, 25, 70, 116, 139, 67, 152, 347, 514, 567, 414, 884, 1744, 2408, 2561, 2498, 4967
Offset: 1

Views

Author

Tanya Khovanova, Jul 28 2007

Keywords

Comments

An n-celled polyhex with perimeter p has (6n+p)/2 edges. The maximum number of edges in an n-celled polyhex is 5n+1.
Given Clarke's table T(p,n), a(n) is an antidiagonal sum selecting entries in a (1,3)-leaper's moves. - R. J. Mathar, Feb 23 2021

Examples

			a(31) = T(p=26,A=6) + T(p=20,A=7) = 36+3 = 39. a(34) = T(p=26,A=7) + T(p=20,A=8) = 69+1 = 70. a(35) = 107+9. a(36) = 118+21. a(41) = 411+155+1. a(44) = 1621 +123. a(45) = 1986+420+2. a(46) = 1489+1046+26. - _R. J. Mathar_, Feb 23 2021
		

Crossrefs

Cf. A000228: Number of hexagonal polyominoes (or planar polyhexes) with n cells. A057779: Hexagonal polyominoes (or polyhexes, A000228) with perimeter 2n. A038142: Number of planar cata-polyhexes with n cells. A131487: analog for square tiling.

Extensions

Extended to a(48). - R. J. Mathar, Feb 23 2021

A130623 Number of polyhexes with perimeter at most 2n.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 6, 8, 20, 34, 84, 182
Offset: 1

Views

Author

Tanya Khovanova, Aug 11 2007

Keywords

Comments

The perimeter of a polyhex is always even.
Partial sums of A057779.
a(2n+1) >= A131467(n).

Crossrefs

Cf. A038142 (planar cata-polyhexes with n cells).
Cf. A057779 (hexagonal polyominoes with perimeter 2n).
Cf. A131467 (planar polyhexes with at most n cells).

Extensions

Offset corrected by John Mason, Jan 16 2023

A137193 Number of n-celled polyhexes with perimeter < 4n+2.

Original entry on oeis.org

0, 0, 1, 2, 10, 46, 215, 1037, 5083, 24918, 122437
Offset: 1

Views

Author

Tanya Khovanova, Mar 03 2008

Keywords

Comments

These are n-cell polyhexes with the perimeter less than the maximum possible one.
If we associate a graph to a polyhex with vertices representing cells and edges representing two cells with a common edge, then this sequence enumerates polyhexes whose corresponding graphs have cycles.

Formula

A176638 Partial sums of A018190.

Original entry on oeis.org

1, 2, 5, 12, 34, 115, 446, 1881, 8386, 38472, 179701, 849285, 4047541, 19415118, 93623028, 453486806, 2205081449, 10758731196, 52651373968, 258365785954, 1270930958357, 6265738653554, 30952863554094, 153191072337297
Offset: 1

Views

Author

Jonathan Vos Post, Apr 22 2010

Keywords

Comments

Partial sums of number of planar simply-connected polyhexes (or benzenoid hydrocarbons) with n hexagons. The only known primes in the partial sum are 2 and 5.

Examples

			a(6) = 1 + 1 + 3 + 7 + 22 + 81 = 115.
		

Crossrefs

Formula

a(n) = SUM[i=1..n] A018190(i).
Showing 1-10 of 10 results.