cp's OEIS Frontend

A255112 Number of length n+5 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.

%I A255112 #8 Jan 24 2018 16:46:31
%S A255112 729,1791,2907,4429,6582,9297,12662,16779,21765,27753,34893,43353,
%T A255112 53320,65001,78624,94439,112719,133761,157887,185445,216810,252385,
%U A255112 292602,337923,388841,445881,509601,580593,659484,746937,843652,950367,1067859
%N A255112 Number of length n+5 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.
%C A255112 Row 5 of A255107.
%H A255112 R. H. Hardin, <a href="/A255112/b255112.txt">Table of n, a(n) for n = 1..210</a>
%F A255112 Empirical: a(n) = (1/120)*n^5 + (1/3)*n^4 + (115/24)*n^3 + (889/6)*n^2 + (3867/10)*n + 111 for n>3.
%F A255112 Empirical g.f.: x*(729 - 2583*x + 3096*x^2 - 728*x^3 - 1272*x^4 + 591*x^5 + 618*x^6 - 594*x^7 + 144*x^8) / (1 - x)^6. - _Colin Barker_, Jan 24 2018
%e A255112 Some solutions for n=4:
%e A255112 ..0....2....1....0....1....2....1....1....0....1....0....2....1....0....0....2
%e A255112 ..2....0....1....1....0....2....1....0....2....0....2....2....0....2....2....0
%e A255112 ..2....0....1....0....0....1....2....1....1....0....0....0....0....2....2....0
%e A255112 ..0....2....1....0....1....1....1....1....1....2....0....1....0....2....2....0
%e A255112 ..0....2....0....1....2....2....1....2....1....2....2....1....0....2....1....0
%e A255112 ..2....2....0....2....2....2....1....2....1....2....2....1....0....0....1....0
%e A255112 ..2....0....0....0....1....0....2....1....0....2....2....2....0....1....1....2
%e A255112 ..1....1....1....1....2....1....0....1....0....2....1....0....0....1....2....2
%e A255112 ..2....1....1....2....2....1....2....2....0....0....2....0....1....1....1....1
%Y A255112 Cf. A255107.
%K A255112 nonn
%O A255112 1,1
%A A255112 _R. H. Hardin_, Feb 14 2015