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.

A334541 a(n) is the number of partitions of n into consecutive parts that differ by 5.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 3, 2, 1, 3, 2, 2, 2, 2, 2, 3, 1, 2, 3, 3, 1, 3, 2, 2, 3, 2, 2, 3, 1, 3, 3, 2, 1, 3, 3, 2, 2, 2, 2, 4, 1, 2, 3, 2, 2, 4, 2, 2, 2, 3, 2, 4, 1, 2, 4, 2, 1, 4, 2, 3, 2, 2, 2, 4, 2, 2, 3, 2, 1, 5]