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.

A240873 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 0
7 1
8 0
9 2
10 1
11 2
12 3
13 3
14 3
15 4
16 4
17 4
18 5
19 4
20 3
21 6
22 4
23 4
24 5
25 3
26 4
27 6
28 4
29 4
30 4
31 4
32 4
33 6
34 4
35 3
36 5
37 4
38 4
39 6
40 3
41 4
42 5
43 4
44 4
45 5
46 4
47 4
48 5
49 4
50 3
51 6
52 4
53 4
54 5
55 3
56 4
57 6
58 4
59 4
60 4
61 4
62 4
63 6
64 4
65 3
66 5
67 4
68 4
69 6
70 3
71 4
72 5
73 4
74 4
75 5
76 4
77 4
78 5
79 4
80 3

List of values

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

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

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