login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204329 Irregular triangle read by rows: T(n,k) (n >= 2) is the number of cubic graphs on 2n nodes with diameter k. 0
1, 0, 2, 0, 2, 3, 0, 1, 15, 2, 1, 0, 0, 34, 43, 6, 2, 0, 0, 34, 351, 93, 24, 6, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

COMMENTS

The number of terms in each row (the maximal diameter) begins 1,2,3,5,6,8,... . I don't know how this sequence continues.

LINKS

Table of n, a(n) for n=2..26.

F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.

EXAMPLE

Triangle begins:

1

0 2

0 2 3

0 1 15 2 1

0 0 34 43 6 2

0 0 34 351 93 24 6 1

...

CROSSREFS

Cf. A002851.

Sequence in context: A132814 A058623 A209689 * A111565 A141099 A127710

Adjacent sequences:  A204326 A204327 A204328 * A204330 A204331 A204332

KEYWORD

nonn,more,tabf

AUTHOR

N. J. A. Sloane, Jan 14 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 16:14 EST 2016. Contains 278985 sequences.