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.

A052335 Number of partitions of n into at most 1 copy of 1, 2 copies of 2, 3 copies of 3, ... .

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 4
6 5
7 7
8 10
9 13
10 17
11 22
12 28
13 36
14 46
15 58
16 73
17 91
18 114
19 141
20 173
21 213
22 261
23 318
24 387
25 469
26 567
27 683
28 821
29 984
30 1176
31 1403
32 1671
33 1984
34 2351
35 2781
36 3284
37 3869
38 4550
39 5343
40 6264
41 7330
42 8565
43 9993
44 11642
45 13543
46 15733
47 18252
48 21148
49 24471
50 28282
51 32646
52 37640
53 43348
54 49867
55 57302
56 65776
57 75426
58 86405
59 98882

List of values

[1, 1, 1, 2, 3, 4, 5, 7, 10, 13, 17, 22, 28, 36, 46, 58, 73, 91, 114, 141, 173, 213, 261, 318, 387, 469, 567, 683, 821, 984, 1176, 1403, 1671, 1984, 2351, 2781, 3284, 3869, 4550, 5343, 6264, 7330, 8565, 9993, 11642, 13543, 15733, 18252, 21148, 24471, 28282, 32646, 37640, 43348, 49867, 57302, 65776, 75426, 86405, 98882]