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.

A370363 Number A(n,k) of partitions of [k*n] into n sets of size k having at least one set of consecutive numbers whose maximum (if k>0) is a multiple of k; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 1
6 0
7 1
8 1
9 1
10 0
11 1
12 1
13 1
14 1
15 0
16 1
17 1
18 7
19 1
20 1
21 0
22 1
23 1
24 28
25 45
26 1
27 1
28 0
29 1
30 1
31 103
32 1063
33 401
34 1
35 1
36 0
37 1
38 1
39 376
40 22893
41 74296
42 4355
43 1
44 1
45 0
46 1
47 1
48 1384
49 503751
50 13080721
51 8182855
52 56127
53 1
54 1
55 0
56 1
57 1
58 5146
59 11432655
60 2443061876
61 15237712355
62 1305232804
63 836353
64 1
65 1

List of values

[0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 7, 1, 1, 0, 1, 1, 28, 45, 1, 1, 0, 1, 1, 103, 1063, 401, 1, 1, 0, 1, 1, 376, 22893, 74296, 4355, 1, 1, 0, 1, 1, 1384, 503751, 13080721, 8182855, 56127, 1, 1, 0, 1, 1, 5146, 11432655, 2443061876, 15237712355, 1305232804, 836353, 1, 1]