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

A289157 Number of unlabeled connected loopless multigraphs with n nodes of degree 4 or less.

Original entry on oeis.org

1, 1, 4, 9, 37, 146, 772, 4449, 30307, 228605, 1921464, 17652327, 176162548, 1893738334, 21806975279, 267636988052, 3486370839295, 48029272657002, 697542580286159, 10649954607360119, 170508064788069346, 2856122791685125616, 49951625299057923405
Offset: 0

Views

Author

Natan Arie Consigli, Jul 04 2017

Keywords

Crossrefs

Column k=4 of A334546.
Cf. A121941 (single edges only), A134818 (with no more than triple edges), A289158 (with no more than double edges).
Cf. A243391 (degree 3 or less).

Programs

  • nauty
    geng -c -D4 ${n} -q | multig -D4 -u

Extensions

a(18)-a(22) from Andrew Howroyd, Mar 20 2020

A303033 Number of unlabeled connected loopless multigraphs with n nodes of degree 5 or less and with single, double or triple edges.

Original entry on oeis.org

1, 1, 3, 12, 81, 535, 5274, 60684, 869238, 14595645, 284939257, 6347472749, 159579271688, 4482770916274, 139578090353236, 4783834092385411, 179397242557917048, 7322223973235272082, 323760818899998259561, 15443359560966718348986, 791699492870169123493379
Offset: 0

Views

Author

Natan Arie Consigli, Jun 04 2018

Keywords

Crossrefs

Programs

  • nauty
    for n in {1..11}; do geng -c -D5 ${n}  -q | multig  -m3 -D5 -u;

Extensions

a(12)-a(20) from Andrew Howroyd, Mar 20 2020

A289988 Number of unlabeled connected loopless multigraphs with n nodes of degree n or less.

Original entry on oeis.org

1, 1, 2, 4, 37, 602, 34126, 6021463, 3616906549, 7361925161868, 51324462383008758, 1240420936122453106498, 105141919479926837860474091, 31581183353539008502807807352728
Offset: 0

Views

Author

Natan Arie Consigli, Aug 19 2017

Keywords

Comments

Multigraphs are loopless.

Crossrefs

Main diagonal of A334546.

Programs

  • nauty
    for n in {1..8}; do geng -c -D${n} ${n} -q | multig -m$[${n}-1] -D$[${n}-1] -u; done

Extensions

a(0) corrected and a(9)-a(13) from Andrew Howroyd, May 05 2020

A303030 Number of unlabeled connected loopless multigraphs with n nodes of degree 3 or less and with single or double edges.

Original entry on oeis.org

1, 1, 2, 4, 12, 22, 68, 166, 534, 1589, 5464, 18579, 68320, 255424, 1000852, 4018156, 16671976, 70890940, 309439942, 1381815168, 6310880471, 29428287639, 140012980007, 678970863717, 3353545264060, 16857749613964, 86191265140699, 447951112379963, 2365177154077186
Offset: 0

Views

Author

Natan Arie Consigli, Apr 17 2018

Keywords

Comments

For n >= 1, a(n) is also the number of hydronitrogen molecules containing only n nitrogen trivalent (octet rule satisfying) atoms. So for example, diazene is counted but hydrazoic acid is not because the former has only trivalent nitrogens and the latter has two non-trivalent nitrogens.
Some of the molecules are theoretical and may or may not exist due to their strained geometries.
Apparently the same as A243391 for n > 2. - Georg Fischer, Oct 16 2018
This is the case since A243391 gives the number of loopless multigraphs with nodes of degree 3 or less. The extra graph in A243391 is the 3-regular graph on 2 nodes. - Andrew Howroyd, Mar 20 2020

Examples

			a(3) = 4 because there are 4 molecules satisfying the above condition: triazane, triazene, triazirine, triazidirine.
Note: hydrazoic acid is not counted because there are 2 nitrogens not satisfying the octet rule (one has a positive formal charge and the other one has a negative one).
Graphically, a(3) = 4 because there are 4 graphs satisfying the above condition: the linear graph, the linear graph with one double edge, the triangle graph, and the triangle graph with one double edge. - _Michael B. Porter_, Apr 28 2018
		

Crossrefs

Programs

  • nauty
    for n in {1..18}; do geng -c -D3 ${n}  -q | multig -m2 -D3 -u;done

Formula

a(n) = A243391(n) for n > 2. - Andrew Howroyd, Mar 20 2020

Extensions

a(20)-a(28) from Andrew Howroyd, Mar 20 2020

A036672 Number of stereoisomers of acyclic hydrocarbons with n carbon atoms.

Original entry on oeis.org

1, 3, 4, 13, 31, 109, 372, 1446, 5714, 23791, 100827, 438019, 1931818, 8648820, 39178079, 179383748, 828905252, 3861958783, 18125392905, 85631735301, 406977645228, 1944737525915, 9338989516911, 45051405221284, 218236995129380, 1061256971559421
Offset: 1

Views

Author

Keywords

Comments

Comment from Sean A. Irvine, edited by Natan Arie Consigli, Dec 26 2016 : (Start)
This is the counting series for the hypothetical stereo-isomers of all acyclic hydrocarbons that satisfy the octet rule.
A036673 is the variant with triple bonds excluded.
A002986 doesn't count stereoisomers.
The reference gives a three-variable generating function and cycle-index over A4 which can produce both these sequences. There are also dependencies on earlier generating functions.
(End)
Read has incorrect a(10)=27100. - Sean A. Irvine, Nov 20 2020

Examples

			From _M. F. Hasler_, Dec 26 2016: (Start)
For n = 1, there is only a(1) = 1 possibility, CH4.
For n = 2, one has C2H6 (ethane, H3C-CH3), C2H4 (ethylene, H2C=CH2 with a double bond), C2H2 (ethyne, HC≡CH, triple bond), whence a(2) = 3.
For n = 3, one has C3H8 (H3C-CH2-CH3), C3H6 (H2C=CH-CH3, propene), and two C3H4 (H2C=C=CH2, propadiene, and HC≡C-CH3: methylacetylene), thus a(3) = 4. Cyclic molecules like cyclopropane C3H6 and cyclopropropene C3H4 are excluded. (End)
From _Natan Arie Consigli_, Dec 26 2016: (Start)
For n = 4, we have butane, isobutane, 1-butene, cis/trans-2-butene, buta-1,2-diene, buta-1,3-diene, butatriene, isobutylene, but-1-yne, but-2-yne, diacetylene, but-1-en-3-yne.
For n = 5 we have:
- 3 alkanes: pentane, methylbutane and neopentane.
- 17 alkenes: 1-pentene, (E/Z)-2-pentene, 1,2-pentadiene, (E/Z)-1,3-pentadiene, 1,4-pentadiene, 1,2,3-petatriene, penta-1,2,4-triene, pentatetraene, 2-methylbut-1-ene, 2-methylbut-2-ene, 3-methylbut-1-ene, isoprene, 3-methylbuta-1,2-diene, (R/S)-penta-2,3-diene.
-11 alkynes: 1-pentyne, 2-pentyne, pent-1-en-4-yne, (E/Z)-pent-3-en-1-yne, penta-1,2-dien-4-yne, penta-1,4-diyne, penta-1,3-diyne, pent-1-en-3-yne, 3-methylbut-1-yne, 2-methylbut-1-en-3-yne. (End)
		

Crossrefs

Extensions

a(10) corrected and more terms from Sean A. Irvine, Nov 20 2020

A134819 Irregular triangle read by rows: the number of hydrocarbon structures that can be drawn with a given number of carbons and units of unsaturation.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 3, 2, 1, 2, 5, 9, 11, 7, 3, 3, 10, 26, 40, 40, 21, 6, 5, 25, 77, 159, 217, 185, 85, 19, 9, 56, 222, 575, 1031, 1230, 920, 356, 50, 18, 139, 654, 2082, 4679, 7437, 7982, 5308, 1804, 204, 35, 338, 1902, 7244, 19983, 40139, 57771, 56437, 33860, 10064, 832
Offset: 1

Views

Author

David Consiglio, Jr., Jan 28 2008, Apr 23 2008

Keywords

Comments

Computed over a period of several years and confirmed using the Molgen program.

Examples

			Triangle begins:
1
1 1 1
1 2 3  2 1
2 5 9 11 7 3
etc.
a(3,1) = 2 because there are two structures that contain 3 carbons and have 1 unit of unsaturation (propene and cyclopropane).
		

Crossrefs

Row sums give A134818.
Showing 1-6 of 6 results.