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.

A161039 Number of partitions of n into odd numbers where every part appears at least 3 times.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 1
7 1
8 1
9 2
10 1
11 1
12 3
13 2
14 2
15 5
16 3
17 3
18 6
19 5
20 6
21 8
22 6
23 7
24 11
25 10
26 9
27 14
28 13
29 13
30 19
31 16
32 18
33 25
34 22
35 25
36 32
37 29
38 31
39 42
40 41
41 41
42 53
43 51
44 54
45 69
46 64
47 69
48 88
49 83
50 89
51 109
52 105
53 112
54 136
55 134
56 141
57 170
58 166
59 177
60 215
61 207
62 219
63 262
64 260
65 276
66 320
67 320
68 341
69 397
70 397
71 417
72 485

List of values

[0, 0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 2, 2, 5, 3, 3, 6, 5, 6, 8, 6, 7, 11, 10, 9, 14, 13, 13, 19, 16, 18, 25, 22, 25, 32, 29, 31, 42, 41, 41, 53, 51, 54, 69, 64, 69, 88, 83, 89, 109, 105, 112, 136, 134, 141, 170, 166, 177, 215, 207, 219, 262, 260, 276, 320, 320, 341, 397, 397, 417, 485]