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.

A339279 Number of partitions of 3*n into powers of 3 where every part appears at least 2 times.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 10
9 13
10 15
11 18
12 22
13 25
14 29
15 34
16 38
17 43
18 50
19 55
20 62
21 70
22 77
23 85
24 95
25 103
26 113
27 126
28 136
29 149
30 164
31 177
32 192
33 210
34 225
35 243
36 265
37 283
38 305
39 330
40 352
41 377
42 406
43 431
44 460
45 494
46 523
47 557
48 595
49 629
50 667
51 710
52 748
53 791
54 841
55 884
56 934
57 989
58 1039
59 1094
60 1156

List of values

[1, 1, 2, 3, 4, 5, 7, 8, 10, 13, 15, 18, 22, 25, 29, 34, 38, 43, 50, 55, 62, 70, 77, 85, 95, 103, 113, 126, 136, 149, 164, 177, 192, 210, 225, 243, 265, 283, 305, 330, 352, 377, 406, 431, 460, 494, 523, 557, 595, 629, 667, 710, 748, 791, 841, 884, 934, 989, 1039, 1094, 1156]