A361043 - cp's OEIS frontend

A361043 Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.

n	a(n)
0	1
1	2
2	1
3	3
4	2
5	1
6	4
7	4
8	2
9	1
10	5
11	8
12	8
13	2
14	1
15	6
16	16
17	32
18	22
19	2
20	1
21	7
22	32
23	128
24	170
25	72
26	2
27	1
28	8
29	64
30	512
31	1366
32	992
33	254
34	2
35	1
36	9
37	128
38	2048
39	10922
40	16512
41	6008
42	926
43	2
44	1
45	10
46	256
47	8192
48	87382
49	261632
50	215766
51	37130
52	3434
53	2
54	1
55	11
56	512
57	32768
58	699050
59	4196352
60	6643782
61	2973350
62	232562
63	12872
64	2
65	1

[1, 2, 1, 3, 2, 1, 4, 4, 2, 1, 5, 8, 8, 2, 1, 6, 16, 32, 22, 2, 1, 7, 32, 128, 170, 72, 2, 1, 8, 64, 512, 1366, 992, 254, 2, 1, 9, 128, 2048, 10922, 16512, 6008, 926, 2, 1, 10, 256, 8192, 87382, 261632, 215766, 37130, 3434, 2, 1, 11, 512, 32768, 699050, 4196352, 6643782, 2973350, 232562, 12872, 2, 1]

cp's OEIS Frontend

A361043 Array read by descending antidiagonals. A(n, k) is, if n > 0, the number of multiset permutations of {0, 1} of length n * k where the number of occurrences of 1 are multiples of n. A(0, k) = k + 1.

Table of values

List of values