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.

A171979 Number of partitions of n such that smaller parts do not occur more frequently than greater parts.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 4
5 5
6 8
7 8
8 12
9 14
10 19
11 21
12 30
13 31
14 42
15 50
16 62
17 69
18 91
19 99
20 126
21 144
22 175
23 198
24 246
25 275
26 331
27 379
28 452
29 509
30 612
31 686
32 811
33 922
34 1076
35 1219
36 1428
37 1604
38 1863
39 2108
40 2434
41 2739
42 3162
43 3551
44 4075
45 4593
46 5240
47 5885
48 6721
49 7527
50 8556
51 9597
52 10870

List of values

[1, 1, 2, 3, 4, 5, 8, 8, 12, 14, 19, 21, 30, 31, 42, 50, 62, 69, 91, 99, 126, 144, 175, 198, 246, 275, 331, 379, 452, 509, 612, 686, 811, 922, 1076, 1219, 1428, 1604, 1863, 2108, 2434, 2739, 3162, 3551, 4075, 4593, 5240, 5885, 6721, 7527, 8556, 9597, 10870]