cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A375924 Number A(n,k) of partitions of [n] such that the element sum of each block is one more than a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 0
6 1
7 1
8 2
9 0
10 1
11 1
12 1
13 5
14 0
15 1
16 1
17 0
18 2
19 15
20 0
21 1
22 1
23 0
24 0
25 4
26 52
27 0
28 1
29 1
30 0
31 1
32 1
33 10
34 203
35 0
36 1
37 1
38 0
39 1
40 2
41 3
42 28
43 877
44 0
45 1
46 1
47 0
48 0
49 0
50 3
51 9
52 96
53 4140
54 0
55 1
56 1
57 0
58 0
59 0
60 0
61 1
62 17
63 320
64 21147
65 0
66 1
67 1
68 0
69 0
70 0
71 1
72 1
73 8
74 108
75 1436
76 115975
77 0

List of values

[1, 1, 1, 1, 1, 0, 1, 1, 2, 0, 1, 1, 1, 5, 0, 1, 1, 0, 2, 15, 0, 1, 1, 0, 0, 4, 52, 0, 1, 1, 0, 1, 1, 10, 203, 0, 1, 1, 0, 1, 2, 3, 28, 877, 0, 1, 1, 0, 0, 0, 3, 9, 96, 4140, 0, 1, 1, 0, 0, 0, 0, 1, 17, 320, 21147, 0, 1, 1, 0, 0, 0, 1, 1, 8, 108, 1436, 115975, 0]