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.

A363048 Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows, where T(n,k) is the number of partitions of n whose greatest part is a multiple of k.

Table of values

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

List of values

[1, 0, 1, 0, 2, 1, 0, 3, 1, 1, 0, 5, 3, 1, 1, 0, 7, 3, 2, 1, 1, 0, 11, 6, 4, 2, 1, 1, 0, 15, 7, 5, 3, 2, 1, 1, 0, 22, 12, 7, 6, 3, 2, 1, 1, 0, 30, 14, 11, 7, 5, 3, 2, 1, 1, 0, 42, 22, 14, 11, 8, 5, 3, 2, 1, 1, 0, 56, 27, 19, 14, 11, 7, 5, 3, 2, 1, 1, 0, 77, 40, 27, 21, 15, 12, 7, 5, 3, 2, 1, 1]