Triangle read by rows: recurrence G(n,k): G(n, n)=G(n+1, 1)=1, G(n+2, 2)=2, G(n+3, k)=G(n+1, k-1)+G(n+1, k-2)+G(n+2, k-1) for k:=2..(n+2), 0<=k<=n.
1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 5, 7, 1, 1, 2, 5, 11, 12, 1, 1, 2, 5, 12, 23, 20, 1, 1, 2, 5
4 seqfan posts
Fri Dec 23 07:47:02 CET 2011 [seqfan] Re: A140993
Fri Dec 23 03:45:04 CET 2011 [seqfan] Re: A140993
Fri Dec 23 02:43:37 CET 2011 [seqfan] Re: A140993
Fri Dec 23 02:33:04 CET 2011 [seqfan] A140993
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.