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.

A363077 Number of partitions of n such that 5*(least part) + 1 = greatest part.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 1
9 2
10 3
11 5
12 7
13 12
14 14
15 21
16 27
17 37
18 46
19 63
20 75
21 97
22 119
23 149
24 178
25 222
26 260
27 317
28 373
29 447
30 520
31 620
32 713
33 839
34 965
35 1123
36 1282
37 1488
38 1687
39 1939
40 2196
41 2508
42 2826
43 3220
44 3610
45 4087
46 4578
47 5157
48 5755
49 6472
50 7199
51 8060
52 8953
53 9991
54 11069
55 12330
56 13625
57 15134
58 16708
59 18508

List of values

[0, 0, 0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 12, 14, 21, 27, 37, 46, 63, 75, 97, 119, 149, 178, 222, 260, 317, 373, 447, 520, 620, 713, 839, 965, 1123, 1282, 1488, 1687, 1939, 2196, 2508, 2826, 3220, 3610, 4087, 4578, 5157, 5755, 6472, 7199, 8060, 8953, 9991, 11069, 12330, 13625, 15134, 16708, 18508]