[go: up one dir, main page]

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

Revision History for A180913 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
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
(history; published version)
#3 by Russ Cox at Sat Mar 31 12:35:48 EDT 2012
AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Sep 23 2010

Discussion
Sat Mar 31
12:35
OEIS Server: https://oeis.org/edit/global/875
#2 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

R. H. Hardin, <a href="/A180913/b180913.txt">Table of n, a(n) for n=1..100</a>

KEYWORD

nonn,new

nonn

#1 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010
NAME

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

DATA

1, 9, 116, 1611, 23354, 346392, 5215708, 79355229, 1216613579, 18760964625, 290630582210, 4518800966943, 70471597046192, 1101783607336424, 17262385062541884, 270952977605157692, 4259594371932890237

OFFSET

1,2

COMMENTS

Paths down a n-high staggered-grid minimally right-leaning right triangle with interior neighbor fanout 2*8

Column 8 of A180915

LINKS

R. H. Hardin, <a href="b180913.txt">Table of n, a(n) for n=1..100</a>

KEYWORD

nonn,new

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Sep 23 2010

STATUS

approved