_R. H. Hardin (rhhardin(AT)att.net) _ Sep 23 2010
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”).
_R. H. Hardin (rhhardin(AT)att.net) _ Sep 23 2010
R. H. Hardin, <a href="/A180913/b180913.txt">Table of n, a(n) for n=1..100</a>
nonn,new
nonn
Number of sequences of n integers p(i) i=0..n-1 with 0<=p(i)<=8*i and -8<p(i)-p(i-1)<=8
1, 9, 116, 1611, 23354, 346392, 5215708, 79355229, 1216613579, 18760964625, 290630582210, 4518800966943, 70471597046192, 1101783607336424, 17262385062541884, 270952977605157692, 4259594371932890237
1,2
Paths down a n-high staggered-grid minimally right-leaning right triangle with interior neighbor fanout 2*8
Column 8 of A180915
R. H. Hardin, <a href="b180913.txt">Table of n, a(n) for n=1..100</a>
nonn,new
R. H. Hardin (rhhardin(AT)att.net) Sep 23 2010
approved