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.

A245039 Number of partitions of n where the minimal multiplicity of any part is 8.

Table of values

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

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 3, 3, 3, 2, 4, 2, 6, 4, 5, 4, 7, 3, 6, 4, 10, 6, 10, 7, 14, 11, 13, 12, 23, 15, 23, 20, 28, 24, 32, 26, 43, 34, 43, 39, 56, 45, 59, 55, 73, 63, 80, 70, 94, 81, 101, 92, 127, 104, 131]