A332099 - cp's OEIS frontend

A332099 Square array T(n,k) = k^n - Sum_{0 < i < k} e(i)*(k-i)^n where e(i) = 1 if the partial sum up to this term would remain <= k^n, or 0 else; n, k >= 1; read by falling antidiagonals.

n	a(n)
1	1
2	1
3	1
4	0
5	3
6	1
7	0
8	4
9	7
10	1
11	0
12	2
13	18
14	15
15	1
16	0
17	0
18	28
19	64
20	31
21	1
22	0
23	1
24	25
25	158
26	210
27	63
28	1
29	0
30	0
31	0
32	271
33	748
34	664
35	127
36	1
37	0
38	1
39	1
40	317
41	1825
42	3302
43	2058
44	255
45	1
46	0
47	0
48	8
49	126
50	3351
51	10735
52	14068
53	6304
54	511
55	1
56	0
57	2
58	0
59	45
60	4606
61	26141
62	59425
63	58718
64	19170
65	1023
66	1
67	0
68	0
69	19
70	47
71	3760
72	50478
73	183111
74	318271
75	241948
76	58024
77	2047
78	1

[1, 1, 1, 0, 3, 1, 0, 4, 7, 1, 0, 2, 18, 15, 1, 0, 0, 28, 64, 31, 1, 0, 1, 25, 158, 210, 63, 1, 0, 0, 0, 271, 748, 664, 127, 1, 0, 1, 1, 317, 1825, 3302, 2058, 255, 1, 0, 0, 8, 126, 3351, 10735, 14068, 6304, 511, 1, 0, 2, 0, 45, 4606, 26141, 59425, 58718, 19170, 1023, 1, 0, 0, 19, 47, 3760, 50478, 183111, 318271, 241948, 58024, 2047, 1]

cp's OEIS Frontend

A332099 Square array T(n,k) = k^n - Sum_{0 < i < k} e(i)*(k-i)^n where e(i) = 1 if the partial sum up to this term would remain <= k^n, or 0 else; n, k >= 1; read by falling antidiagonals.

Table of values

List of values