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.

A067059 Square array read by antidiagonals of partitions which half fill an n*k box, i.e., partitions of floor(nk/2) or ceiling(nk/2) into up to n positive integers, each no more than k.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 1
8 1
9 1
10 1
11 1
12 2
13 1
14 1
15 1
16 1
17 2
18 2
19 1
20 1
21 1
22 1
23 3
24 3
25 3
26 1
27 1
28 1
29 1
30 3
31 5
32 5
33 3
34 1
35 1
36 1
37 1
38 4
39 6
40 8
41 6
42 4
43 1
44 1
45 1
46 1
47 4
48 8
49 12
50 12
51 8
52 4
53 1
54 1
55 1
56 1
57 5
58 10
59 18
60 20
61 18
62 10
63 5
64 1
65 1
66 1
67 1
68 5
69 13
70 24
71 32
72 32
73 24
74 13
75 5
76 1
77 1
78 1
79 1
80 6
81 15
82 33
83 49
84 58
85 49
86 33
87 15
88 6
89 1
90 1
91 1
92 1
93 6

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 3, 3, 1, 1, 1, 1, 3, 5, 5, 3, 1, 1, 1, 1, 4, 6, 8, 6, 4, 1, 1, 1, 1, 4, 8, 12, 12, 8, 4, 1, 1, 1, 1, 5, 10, 18, 20, 18, 10, 5, 1, 1, 1, 1, 5, 13, 24, 32, 32, 24, 13, 5, 1, 1, 1, 1, 6, 15, 33, 49, 58, 49, 33, 15, 6, 1, 1, 1, 1, 6]