A104746 - cp's OEIS frontend

A104746 Array T(n,k) read by antidiagonals: T(1,k) = 2^k-1 and recursively T(n,k) = T(n-1,k) + A000337(k-1), n,k >= 1.

n	a(n)
1	1
2	1
3	3
4	1
5	4
6	7
7	1
8	5
9	12
10	15
11	1
12	6
13	17
14	32
15	31
16	1
17	7
18	22
19	49
20	80
21	63
22	1
23	8
24	27
25	66
26	129
27	192
28	127
29	1
30	9
31	32
32	83
33	178
34	321
35	448
36	255
37	1
38	10
39	37
40	100
41	227
42	450
43	769
44	1024
45	511
46	1
47	11
48	42
49	117
50	276
51	579
52	1090
53	1793
54	2304
55	1023
56	1
57	12
58	47
59	134
60	325
61	708
62	1411
63	2562
64	4097
65	5120
66	2047
67	1
68	13
69	52
70	151
71	374
72	837
73	1732
74	3331
75	5890
76	9217
77	11264
78	4095

[1, 1, 3, 1, 4, 7, 1, 5, 12, 15, 1, 6, 17, 32, 31, 1, 7, 22, 49, 80, 63, 1, 8, 27, 66, 129, 192, 127, 1, 9, 32, 83, 178, 321, 448, 255, 1, 10, 37, 100, 227, 450, 769, 1024, 511, 1, 11, 42, 117, 276, 579, 1090, 1793, 2304, 1023, 1, 12, 47, 134, 325, 708, 1411, 2562, 4097, 5120, 2047, 1, 13, 52, 151, 374, 837, 1732, 3331, 5890, 9217, 11264, 4095]

cp's OEIS Frontend

A104746 Array T(n,k) read by antidiagonals: T(1,k) = 2^k-1 and recursively T(n,k) = T(n-1,k) + A000337(k-1), n,k >= 1.

Table of values

List of values