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).

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

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