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 #13 Jun 02 2018 10:34:45
%S 1,6,32,121,356,881,1925,3830,7083,12352,20526,32759,50518,75635,
%T 110363,157436,220133,302346,408652,544389,715736,929797,1194689,
%U 1519634,1915055,2392676,2965626,3648547,4457706,5411111,6528631,7832120,9345545
%N Number of n X 3 nonnegative integer arrays with each row and column increasing from zero by 0, 1 or 2.
%C Column 3 of A202812.
%H R. H. Hardin, <a href="/A202807/b202807.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = (1/180)*n^6 + (1/20)*n^5 + (13/72)*n^4 - (67/360)*n^2 + (19/20)*n.
%F Conjectures from _Colin Barker_, Jun 02 2018: (Start)
%F G.f.: x*(1 - x + 11*x^2 - 12*x^3 + 6*x^4 - x^5) / (1 - x)^7.
%F a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7) for n>7.
%F (End)
%e Some solutions for n=5:
%e 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
%e 0 0 0 0 0 1 0 0 1 0 0 0 0 1 2 0 1 1 0 0 0
%e 0 1 2 0 0 1 0 0 1 0 0 0 0 1 2 0 1 1 0 0 2
%e 0 2 2 0 2 3 0 1 3 0 0 2 0 2 2 0 2 2 0 1 2
%e 0 2 4 0 2 3 0 2 4 0 1 3 0 2 2 0 2 2 0 2 2
%Y Cf. A202812.
%K nonn
%O 1,2
%A _R. H. Hardin_, Dec 24 2011