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.

A272397 Number of partitions of n into parts congruent to 1, 3, 6, 8 (mod 9).

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 2
6 4
7 4
8 5
9 7
10 8
11 9
12 13
13 14
14 16
15 21
16 24
17 27
18 35
19 39
20 45
21 55
22 62
23 70
24 86
25 96
26 109
27 130
28 146
29 164
30 195
31 217
32 245
33 285
34 319
35 357
36 415
37 461
38 517
39 592
40 660
41 735
42 840
43 931
44 1038
45 1175
46 1304
47 1446
48 1634
49 1805
50 2002
51 2246
52 2482
53 2742
54 3070
55 3381
56 3734

List of values

[1, 1, 1, 2, 2, 2, 4, 4, 5, 7, 8, 9, 13, 14, 16, 21, 24, 27, 35, 39, 45, 55, 62, 70, 86, 96, 109, 130, 146, 164, 195, 217, 245, 285, 319, 357, 415, 461, 517, 592, 660, 735, 840, 931, 1038, 1175, 1304, 1446, 1634, 1805, 2002, 2246, 2482, 2742, 3070, 3381, 3734]