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.

A274859 Number A(n,k) of set partitions of [n] such that the difference between each element and its index (in the partition) is 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 2
6 1
7 1
8 2
9 4
10 1
11 1
12 2
13 5
14 8
15 1
16 1
17 2
18 4
19 15
20 16
21 1
22 1
23 2
24 4
25 8
26 52
27 32
28 1
29 1
30 2
31 4
32 8
33 18
34 203
35 64
36 1
37 1
38 2
39 4
40 8
41 16
42 40
43 877
44 128
45 1
46 1
47 2
48 4
49 8
50 16
51 32
52 101
53 4140
54 256
55 1
56 1
57 2
58 4
59 8
60 16
61 32
62 68
63 254
64 21147
65 512
66 1
67 1
68 2
69 4
70 8
71 16
72 32
73 64
74 144
75 723
76 115975
77 1024

List of values

[1, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 5, 8, 1, 1, 2, 4, 15, 16, 1, 1, 2, 4, 8, 52, 32, 1, 1, 2, 4, 8, 18, 203, 64, 1, 1, 2, 4, 8, 16, 40, 877, 128, 1, 1, 2, 4, 8, 16, 32, 101, 4140, 256, 1, 1, 2, 4, 8, 16, 32, 68, 254, 21147, 512, 1, 1, 2, 4, 8, 16, 32, 64, 144, 723, 115975, 1024]