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.

A275069 Number A(n,k) of set partitions of [n] such that i-j is a multiple of k for all i,j belonging to the same block; 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 1
6 1
7 1
8 2
9 1
10 1
11 1
12 1
13 5
14 1
15 1
16 1
17 1
18 2
19 15
20 1
21 1
22 1
23 1
24 1
25 4
26 52
27 1
28 1
29 1
30 1
31 1
32 2
33 10
34 203
35 1
36 1
37 1
38 1
39 1
40 1
41 4
42 25
43 877
44 1
45 1
46 1
47 1
48 1
49 1
50 2
51 8
52 75
53 4140
54 1
55 1
56 1
57 1
58 1
59 1
60 1
61 4
62 20
63 225
64 21147
65 1
66 1
67 1
68 1
69 1
70 1
71 1
72 2
73 8
74 50
75 780
76 115975
77 1

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 5, 1, 1, 1, 1, 2, 15, 1, 1, 1, 1, 1, 4, 52, 1, 1, 1, 1, 1, 2, 10, 203, 1, 1, 1, 1, 1, 1, 4, 25, 877, 1, 1, 1, 1, 1, 1, 2, 8, 75, 4140, 1, 1, 1, 1, 1, 1, 1, 4, 20, 225, 21147, 1, 1, 1, 1, 1, 1, 1, 2, 8, 50, 780, 115975, 1]