

A055818


Array T read by rows: T(i,j)=R(ij,j), where R(i,0)=R(0,i)=1 for i >= 0, R(i,j)=Sum{R(h,k): 0<=h<=i1, 0<=k<=j} for i >= 1, j >= 1.


12



1, 1, 1, 1, 2, 1, 1, 5, 3, 1, 1, 11, 9, 4, 1, 1, 23, 24, 14, 5, 1, 1, 47, 60, 43, 20, 6, 1, 1, 95, 144, 122, 69, 27, 7, 1, 1, 191, 336, 328, 217, 103, 35, 8, 1, 1, 383, 768, 848, 640, 354, 146, 44, 9, 1, 1, 767, 1728, 2128, 1800, 1131, 543, 199
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,5


REFERENCES

C. Kimberling, Pathcounting and Fibonacci numbers, Fib. Quart. 40 (4) (2002) 328338, example 3B.


LINKS

Table of n, a(n) for n=0..62.


EXAMPLE

Rows: 1; 1,1; 1,2,1; 1,5,3,1; 1,11,9,4,1; ...


CROSSREFS

Sequence in context: A079213 A047884 A124328 * A106240 A097615 A288386
Adjacent sequences: A055815 A055816 A055817 * A055819 A055820 A055821


KEYWORD

nonn,tabl


AUTHOR

Clark Kimberling, May 28 2000


STATUS

approved



