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.

A122768 Number of combinations which can be taken from the integer partitions of n. Total number of cases in the (n,m)-fragmentation process.

Table of values

n a(n)
0 0
1 1
2 3
3 7
4 15
5 29
6 54
7 95
8 163
9 270
10 439
11 696
12 1088
13 1669
14 2530
15 3780
16 5591
17 8173
18 11845
19 17000
20 24215
21 34210
22 48008
23 66895
24 92660
25 127554
26 174651
27 237830
28 322297
29 434625
30 583524
31 779972
32 1038356
33 1376787
34 1818755
35 2393775
36 3139812
37 4104433
38 5348375
39 6947545
40 8998201
41 11620313
42 14965126
43 19220569

List of values

[0, 1, 3, 7, 15, 29, 54, 95, 163, 270, 439, 696, 1088, 1669, 2530, 3780, 5591, 8173, 11845, 17000, 24215, 34210, 48008, 66895, 92660, 127554, 174651, 237830, 322297, 434625, 583524, 779972, 1038356, 1376787, 1818755, 2393775, 3139812, 4104433, 5348375, 6947545, 8998201, 11620313, 14965126, 19220569]