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.

A245041 Number of partitions of n where the minimal multiplicity of any part is 10.

Table of values

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

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 3, 3, 3, 2, 4, 2, 3, 3, 6, 3, 6, 4, 6, 4, 6, 3, 7, 4, 9, 6, 11, 7, 13, 11, 14, 12, 17, 13, 25, 18, 24, 22, 30, 26, 35, 28, 37, 33, 49, 37, 53, 45, 56, 54, 67, 58]