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.

A100926 Number of partitions of n into parts free of odd squares and the only number with multiplicity in the unrestricted partitions is the number 2.

Table of values

n a(n)
1 1
2 0
3 1
4 1
5 2
6 2
7 3
8 4
9 5
10 6
11 8
12 10
13 12
14 15
15 18
16 23
17 27
18 33
19 40
20 48
21 57
22 69
23 81
24 97
25 113
26 134
27 157
28 184
29 214
30 250
31 290
32 337
33 389
34 451
35 519
36 598
37 688
38 789
39 904
40 1035
41 1181
42 1348
43 1535
44 1746
45 1983
46 2250
47 2549
48 2885
49 3261
50 3682
51 4154
52 4680
53 5268
54 5923
55 6656
56 7468

List of values

[1, 0, 1, 1, 2, 2, 3, 4, 5, 6, 8, 10, 12, 15, 18, 23, 27, 33, 40, 48, 57, 69, 81, 97, 113, 134, 157, 184, 214, 250, 290, 337, 389, 451, 519, 598, 688, 789, 904, 1035, 1181, 1348, 1535, 1746, 1983, 2250, 2549, 2885, 3261, 3682, 4154, 4680, 5268, 5923, 6656, 7468]