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.

A238394 Number of partitions of n that sorted in increasing order do not contain a part k in position k.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 2
6 3
7 3
8 4
9 5
10 8
11 9
12 12
13 13
14 17
15 22
16 28
17 34
18 42
19 48
20 59
21 71
22 88
23 106
24 130
25 151
26 181
27 210
28 250
29 295
30 354
31 417
32 494
33 577
34 675
35 780
36 909
37 1053
38 1231
39 1431
40 1668
41 1930
42 2240
43 2573
44 2963
45 3392
46 3896
47 4461
48 5129
49 5873
50 6742
51 7710
52 8816
53 10043
54 11439

List of values

[1, 0, 1, 1, 1, 2, 3, 3, 4, 5, 8, 9, 12, 13, 17, 22, 28, 34, 42, 48, 59, 71, 88, 106, 130, 151, 181, 210, 250, 295, 354, 417, 494, 577, 675, 780, 909, 1053, 1231, 1431, 1668, 1930, 2240, 2573, 2963, 3392, 3896, 4461, 5129, 5873, 6742, 7710, 8816, 10043, 11439]