|
Search: id:A068914
|
|
|
| A068914 |
|
Square array read by antidiagonals of number of k step walks (each step +/-1 starting from 0) which are never more than n or less than 0. |
|
+0
2
|
|
| 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 1, 0, 1, 2, 2, 1, 1, 0, 1, 4, 3, 2, 1, 1, 0, 1, 4, 5, 3, 2, 1, 1, 0, 1, 8, 8, 6, 3, 2, 1, 1, 0, 1, 8, 13, 9, 6, 3, 2, 1, 1, 0, 1, 16, 21, 18, 10, 6, 3, 2, 1, 1, 0, 1, 16, 34, 27, 19, 10, 6, 3, 2, 1, 1, 0, 1, 32, 55, 54, 33, 20, 10, 6, 3, 2, 1, 1, 0, 1, 32, 89
(list; table; graph; listen)
|
|
|
OFFSET
|
0,13
|
|
|
EXAMPLE
|
Rows start 1,0,0,0,0,...; 1,1,1,1,1,...; 1,1,2,2,4,...; 1,1,2,3,5,...; etc.
|
|
CROSSREFS
|
Rows include effectively A000007, A000012, A016116, A000045, A038754, A028495, A030436, A061551. Central and lower diagonals are A001405. Cf. A068913 for starting in the middle rather than an edge.
Reflected version of A094718.
Sequence in context: A069713 A072233 A116598 this_sequence A090824 A099314 A131334
Adjacent sequences: A068911 A068912 A068913 this_sequence A068915 A068916 A068917
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Mar 06 2002
|
|
|
Search completed in 0.002 seconds
|
