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.

A350893 Number of partitions of n such that (smallest part) = 2*(number of parts).

Table of values

n a(n)
1 0
2 1
3 0
4 0
5 0
6 0
7 0
8 1
9 1
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 2
19 2
20 3
21 3
22 4
23 4
24 5
25 5
26 6
27 6
28 7
29 7
30 8
31 8
32 10
33 10
34 12
35 13
36 15
37 16
38 19
39 20
40 23
41 25
42 28
43 30
44 34
45 36
46 40
47 43
48 47
49 50
50 56
51 59
52 65
53 70
54 77
55 82
56 91
57 97
58 107
59 115
60 126
61 135
62 149
63 159
64 174
65 187
66 204
67 218
68 238
69 254
70 276
71 295
72 320
73 341
74 370
75 394
76 426
77 455
78 491
79 523
80 565

List of values

[0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 10, 10, 12, 13, 15, 16, 19, 20, 23, 25, 28, 30, 34, 36, 40, 43, 47, 50, 56, 59, 65, 70, 77, 82, 91, 97, 107, 115, 126, 135, 149, 159, 174, 187, 204, 218, 238, 254, 276, 295, 320, 341, 370, 394, 426, 455, 491, 523, 565]