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.

A346798 Number of partitions of n into parts congruent to 0, 3 or 4 (mod 7).

Table of values

n a(n)
0 1
1 0
2 0
3 1
4 1
5 0
6 1
7 2
8 1
9 1
10 3
11 3
12 2
13 3
14 6
15 4
16 4
17 8
18 9
19 6
20 10
21 15
22 12
23 12
24 21
25 22
26 18
27 25
28 36
29 30
30 32
31 48
32 52
33 45
34 60
35 78
36 72
37 75
38 105
39 113
40 105
41 130
42 166
43 156
44 166
45 218
46 236
47 224
48 274
49 332
50 325
51 345
52 436
53 469
54 462
55 544
56 649
57 644
58 688
59 839
60 907
61 903
62 1051

List of values

[1, 0, 0, 1, 1, 0, 1, 2, 1, 1, 3, 3, 2, 3, 6, 4, 4, 8, 9, 6, 10, 15, 12, 12, 21, 22, 18, 25, 36, 30, 32, 48, 52, 45, 60, 78, 72, 75, 105, 113, 105, 130, 166, 156, 166, 218, 236, 224, 274, 332, 325, 345, 436, 469, 462, 544, 649, 644, 688, 839, 907, 903, 1051]