A053199 - cp's OEIS frontend

A053199 Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.

n	a(n)
0	1
1	2
2	3
3	3
4	5
5	14
6	4
7	7
8	21
9	60
10	5
11	9
12	28
13	84
14	246
15	6
16	11
17	35
18	108
19	328
20	980
21	7
22	13
23	42
24	132
25	410
26	1260
27	3824
28	8
29	15
30	49
31	156
32	492
33	1540
34	4780
35	14688
36	9
37	17
38	56
39	180
40	574
41	1820
42	5736
43	17952
44	55720
45	10
46	19
47	63
48	204
49	656
50	2100
51	6692

[1, 2, 3, 3, 5, 14, 4, 7, 21, 60, 5, 9, 28, 84, 246, 6, 11, 35, 108, 328, 980, 7, 13, 42, 132, 410, 1260, 3824, 8, 15, 49, 156, 492, 1540, 4780, 14688, 9, 17, 56, 180, 574, 1820, 5736, 17952, 55720, 10, 19, 63, 204, 656, 2100, 6692]

cp's OEIS Frontend

A053199 Triangular array T: put T(n,0)=n+1 for all n >= 0 and all other T(n,k)=0; then put T(n,k)=Sum{T(i,j): 0<=j<=i-n+k, n-k<=i<=n}.

Table of values

List of values