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.

A166247 Number of perfect partitions of n-1 plus sum of remainders of n mod k, for k=1,2,3,..,n.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 6
7 9
8 12
9 14
10 16
11 23
12 25
13 29
14 34
15 39
16 44
17 52
18 55
19 65
20 69
21 73
22 80
23 99
24 105
25 105
26 115
27 129
28 132
29 152
30 151
31 168
32 183
33 187
34 200
35 221
36 224
37 234
38 251
39 272
40 278
41 298
42 297
43 326
44 336
45 347
46 361
47 404
48 422
49 416
50 428
51 452
52 462
53 506
54 512
55 532
56 540
57 556
58 581
59 636

List of values

[1, 1, 2, 3, 5, 6, 9, 12, 14, 16, 23, 25, 29, 34, 39, 44, 52, 55, 65, 69, 73, 80, 99, 105, 105, 115, 129, 132, 152, 151, 168, 183, 187, 200, 221, 224, 234, 251, 272, 278, 298, 297, 326, 336, 347, 361, 404, 422, 416, 428, 452, 462, 506, 512, 532, 540, 556, 581, 636]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.