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.

A092319 Sum of smallest parts of all partitions of n into odd distinct parts.

Table of values

n a(n)
1 1
2 0
3 3
4 1
5 5
6 1
7 7
8 4
9 10
10 4
11 12
12 9
13 15
14 9
15 20
16 17
17 23
18 17
19 28
20 27
21 36
22 28
23 41
24 43
25 50
26 44
27 62
28 62
29 71
30 66
31 84
32 91
33 103
34 96
35 119
36 127
37 139
38 137
39 167
40 178
41 191
42 192
43 223
44 241
45 266
46 264
47 302
48 331
49 351
50 360
51 411
52 439
53 469
54 485
55 542
56 587
57 628
58 646
59 714
60 773
61 819
62 854
63 945

List of values

[1, 0, 3, 1, 5, 1, 7, 4, 10, 4, 12, 9, 15, 9, 20, 17, 23, 17, 28, 27, 36, 28, 41, 43, 50, 44, 62, 62, 71, 66, 84, 91, 103, 96, 119, 127, 139, 137, 167, 178, 191, 192, 223, 241, 266, 264, 302, 331, 351, 360, 411, 439, 469, 485, 542, 587, 628, 646, 714, 773, 819, 854, 945]

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

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