login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A275622 Triangle read by rows: T(n,k) = number of cubic graphs with 2n nodes and packing chromatic number k (n>=2, 4 <= k <= n+2). 0
1, 1, 1, 0, 3, 2, 0, 3, 15, 1, 0, 7, 42, 36, 0, 0, 13, 252, 222, 22, 0, 34, 907, 2685, 433, 1, 0, 116, 5277, 21544, 14050, 314, 0, 151, 22098, 206334, 226622 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

2,5

LINKS

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

Nicolas Gastineau and Olivier Togni, S-Packing Colorings of Cubic Graphs, arXiv:1403:7495 [cs.DM], 2016.

EXAMPLE

Triangle begins:

1,

1,1,

0,3,2,

0,3,15,1,

0,7,42,36,0,

0,13,252,222,22,

0,34,907,2685,433,1,

0,116,5277,21544,14050,314,

0,151,22098,206334,226622,...

CROSSREFS

Sequence in context: A198826 A088161 A005874 * A129239 A224825 A341413

Adjacent sequences:  A275619 A275620 A275621 * A275623 A275624 A275625

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane, Aug 04 2016

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 27 09:55 EDT 2021. Contains 348274 sequences. (Running on oeis4.)