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.

A334466 Square array read by antidiagonals upwards: T(n,k) is the total number of parts in all partitions of n into consecutive parts that differ by k, with n >= 1, k >= 0.

Table of values

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

List of values

[1, 3, 1, 4, 1, 1, 7, 3, 1, 1, 6, 1, 1, 1, 1, 12, 3, 3, 1, 1, 1, 8, 4, 1, 1, 1, 1, 1, 15, 3, 3, 3, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 18, 6, 3, 3, 3, 1, 1, 1, 1, 1, 12, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 28, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 14, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 24, 3, 6, 3, 3, 3, 3, 1]