login

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

A211562
Number of nonnegative integer arrays of length n+2 with new values 0 upwards introduced in order, and containing the value n-1.
1
5, 14, 36, 81, 162, 295, 499, 796, 1211, 1772, 2510, 3459, 4656, 6141, 7957, 10150, 12769, 15866, 19496, 23717, 28590, 34179, 40551, 47776, 55927, 65080, 75314, 86711, 99356, 113337, 128745, 145674, 164221, 184486, 206572, 230585, 256634, 284831
OFFSET
1,1
COMMENTS
Row 3 of A211561.
LINKS
FORMULA
Empirical: a(n) = (1/8)*n^4 + (5/12)*n^3 + (7/8)*n^2 + (19/12)*n + 2.
Empirical: a(n) = sum{j in n..n+2}stirling2(n+2,j).
Conjectures from Colin Barker, Jul 19 2018: (Start)
G.f.: x*(5 - 11*x + 16*x^2 - 9*x^3 + 2*x^4) / (1 - x)^5.
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5) for n>5.
(End)
EXAMPLE
Some solutions for n=5:
..0....0....0....0....0....0....0....0....0....0....0....0....0....0....0....0
..1....1....1....1....1....1....1....1....1....1....1....1....1....1....1....1
..2....2....2....2....2....2....0....0....2....2....2....1....2....2....2....2
..3....1....2....3....3....0....2....2....2....0....3....2....3....3....3....3
..0....1....1....3....2....3....2....0....3....1....4....3....4....4....1....4
..4....3....3....1....0....2....3....3....4....3....3....2....5....3....2....0
..4....4....4....4....4....4....4....4....1....4....1....4....4....5....4....1
CROSSREFS
Cf. A211561.
Sequence in context: A142585 A332743 A234097 * A261055 A320853 A193557
KEYWORD
nonn
AUTHOR
R. H. Hardin, Apr 15 2012
STATUS
approved