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.

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

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 0
7 1
8 0
9 1
10 1
11 1
12 2
13 1
14 3
15 1
16 2
17 2
18 2
19 2
20 1
21 4
22 2
23 3
24 3
25 5
26 5
27 6
28 8
29 8
30 9
31 10
32 13
33 14
34 16
35 18
36 20
37 20
38 24
39 25
40 28
41 31
42 36
43 37
44 40
45 42
46 46
47 51
48 55
49 62
50 65
51 72
52 76
53 83
54 89
55 98
56 107
57 117
58 126
59 139
60 149
61 163
62 177
63 195
64 208
65 226
66 247
67 267
68 291

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 2, 1, 3, 1, 2, 2, 2, 2, 1, 4, 2, 3, 3, 5, 5, 6, 8, 8, 9, 10, 13, 14, 16, 18, 20, 20, 24, 25, 28, 31, 36, 37, 40, 42, 46, 51, 55, 62, 65, 72, 76, 83, 89, 98, 107, 117, 126, 139, 149, 163, 177, 195, 208, 226, 247, 267, 291]

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

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