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.

A350899 Number of partitions of n such that (smallest part) = 5*(number of parts).

Table of values

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

List of values

[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 20, 21, 22, 24, 25, 27, 29, 31, 33, 36, 38, 41, 44, 47]