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.

A092269 Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.

Table of values

n a(n)
1 1
2 3
3 5
4 10
5 14
6 26
7 35
8 57
9 80
10 119
11 161
12 238
13 315
14 440
15 589
16 801
17 1048
18 1407
19 1820
20 2399
21 3087
22 3998
23 5092
24 6545
25 8263
26 10486
27 13165
28 16562
29 20630
30 25773
31 31897
32 39546
33 48692
34 59960
35 73423
36 89937
37 109553
38 133439
39 161840
40 196168
41 236843
42 285816
43 343667
44 412950
45 494702
46 592063
47 706671

List of values

[1, 3, 5, 10, 14, 26, 35, 57, 80, 119, 161, 238, 315, 440, 589, 801, 1048, 1407, 1820, 2399, 3087, 3998, 5092, 6545, 8263, 10486, 13165, 16562, 20630, 25773, 31897, 39546, 48692, 59960, 73423, 89937, 109553, 133439, 161840, 196168, 236843, 285816, 343667, 412950, 494702, 592063, 706671]

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

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