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

A047010
Array T read by diagonals: T(h,k)=number of paths consisting of steps from (0,0) to (h,k) such that each step has length 1 directed up or right and no step touches the line y=x/3 unless x=0 or x=h.
10
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 2, 1, 1, 4, 6, 3, 1, 1, 1, 5, 10, 9, 3, 2, 1, 1, 6, 15, 19, 12, 3, 3, 1, 1, 7, 21, 34, 31, 15, 6, 4, 1, 1, 8, 28, 55, 65, 46, 15, 4, 5, 1, 1, 9, 36, 83, 120, 111, 61, 15, 9, 6, 1, 1, 10, 45, 119, 203, 231, 172, 76, 15
OFFSET
0,8
LINKS
M. Janjic and B. Petkovic, A Counting Function, arXiv preprint arXiv:1301.4550, 2013. - From N. J. A. Sloane, Feb 13 2013
EXAMPLE
Diagonals (beginning on row 0): {1}; {1,1}; {1,1,1}; {1,2,1,1}; {1,3,3,2,1}; ...
CROSSREFS
Sequence in context: A180303 A118923 A292745 * A047100 A124772 A227543
KEYWORD
nonn,tabl
STATUS
approved