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.

A241272 Number of partitions p of n into distinct parts such that max(p) = 5*min(p).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 1
10 1
11 1
12 2
13 1
14 0
15 2
16 1
17 1
18 2
19 2
20 2
21 3
22 3
23 4
24 6
25 5
26 5
27 7
28 7
29 9
30 11
31 10
32 11
33 12
34 12
35 14
36 18
37 18
38 18
39 21
40 21
41 24
42 27
43 30
44 30
45 36
46 37
47 42
48 47
49 49
50 54
51 60
52 64
53 71
54 81
55 83
56 91
57 100
58 107
59 116
60 129
61 136
62 147
63 159
64 172
65 184
66 200
67 213
68 228

List of values

[0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 2, 1, 0, 2, 1, 1, 2, 2, 2, 3, 3, 4, 6, 5, 5, 7, 7, 9, 11, 10, 11, 12, 12, 14, 18, 18, 18, 21, 21, 24, 27, 30, 30, 36, 37, 42, 47, 49, 54, 60, 64, 71, 81, 83, 91, 100, 107, 116, 129, 136, 147, 159, 172, 184, 200, 213, 228]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.