Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Aug 04 2016 05:00:58
%S 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,
%T 0,116,5277,21544,14050,314,0,151,22098,206334,226622
%N 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).
%H Nicolas Gastineau and Olivier Togni, <a href="http://arxiv.org/abs/1403.7495">S-Packing Colorings of Cubic Graphs</a>, arXiv:1403:7495 [cs.DM], 2016.
%e Triangle begins:
%e 1,
%e 1,1,
%e 0,3,2,
%e 0,3,15,1,
%e 0,7,42,36,0,
%e 0,13,252,222,22,
%e 0,34,907,2685,433,1,
%e 0,116,5277,21544,14050,314,
%e 0,151,22098,206334,226622,...
%K nonn,tabl
%O 2,5
%A _N. J. A. Sloane_, Aug 04 2016