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.

A325391 Number of reversed integer partitions of n whose k-th differences are strictly increasing for all k >= 0.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 3
7 5
8 5
9 6
10 8
11 9
12 9
13 13
14 13
15 15
16 19
17 20
18 20
19 28
20 28
21 30
22 36
23 40
24 40
25 50
26 50
27 56
28 64
29 68
30 68
31 86
32 86
33 92
34 102
35 112
36 114
37 133
38 133
39 146
40 158
41 173
42 173
43 202
44 202
45 215
46 237
47 256
48 256
49 287
50 287
51 324
52 340
53 359
54 359
55 403
56 423
57 446
58 464
59 495
60 495

List of values

[1, 1, 1, 2, 2, 3, 3, 5, 5, 6, 8, 9, 9, 13, 13, 15, 19, 20, 20, 28, 28, 30, 36, 40, 40, 50, 50, 56, 64, 68, 68, 86, 86, 92, 102, 112, 114, 133, 133, 146, 158, 173, 173, 202, 202, 215, 237, 256, 256, 287, 287, 324, 340, 359, 359, 403, 423, 446, 464, 495, 495]

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

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