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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

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 | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified August 29 03:31 EDT 2015. Contains 261184 sequences.