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.

A114097 Number of partitions of n into parts that are distinct mod 10.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 4
7 5
8 6
9 8
10 10
11 12
12 14
13 18
14 20
15 25
16 30
17 34
18 40
19 47
20 56
21 63
22 73
23 84
24 95
25 111
26 127
27 140
28 161
29 180
30 209
31 230
32 259
33 288
34 322
35 366
36 405
37 443
38 498
39 545
40 618
41 675
42 740
43 813
44 894
45 1002
46 1084
47 1181
48 1304
49 1410
50 1569
51 1706
52 1833
53 2001
54 2169
55 2409
56 2569

List of values

[1, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 14, 18, 20, 25, 30, 34, 40, 47, 56, 63, 73, 84, 95, 111, 127, 140, 161, 180, 209, 230, 259, 288, 322, 366, 405, 443, 498, 545, 618, 675, 740, 813, 894, 1002, 1084, 1181, 1304, 1410, 1569, 1706, 1833, 2001, 2169, 2409, 2569]