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.

A339405 Number of partitions of n into an odd number of parts that are not multiples of 3.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 3
6 3
7 5
8 6
9 8
10 11
11 14
12 17
13 23
14 28
15 35
16 44
17 55
18 66
19 83
20 100
21 122
22 148
23 179
24 213
25 259
26 307
27 366
28 436
29 518
30 609
31 723
32 848
33 997
34 1169
35 1369
36 1593
37 1864
38 2163
39 2513
40 2914
41 3376
42 3894
43 4503
44 5182
45 5965
46 6854
47 7869
48 9008
49 10325
50 11794
51 13470
52 15363
53 17509
54 19911
55 22654
56 25713
57 29177

List of values

[0, 1, 1, 1, 2, 3, 3, 5, 6, 8, 11, 14, 17, 23, 28, 35, 44, 55, 66, 83, 100, 122, 148, 179, 213, 259, 307, 366, 436, 518, 609, 723, 848, 997, 1169, 1369, 1593, 1864, 2163, 2513, 2914, 3376, 3894, 4503, 5182, 5965, 6854, 7869, 9008, 10325, 11794, 13470, 15363, 17509, 19911, 22654, 25713, 29177]