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.

A156042 A(n,k) for n >= k in triangular ordering, where A(n,k) is the number of compositions (ordered partitions) of n into k parts, with the first part greater than or equal to all other parts.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 2
6 4
7 1
8 3
9 6
10 11
11 1
12 3
13 8
14 17
15 32
16 1
17 4
18 11
19 26
20 54
21 102
22 1
23 4
24 13
25 35
26 82
27 172
28 331
29 1
30 5
31 17
32 48
33 120
34 272
35 567
36 1101
37 1
38 5
39 20
40 63
41 170
42 412
43 918
44 1906
45 3724
46 1
47 6
48 24
49 81
50 235
51 607
52 1434
53 3152
54 6518
55 12782
56 1
57 6
58 28
59 102
60 317
61 872
62 2180
63 5049
64 10978
65 22616
66 44444

List of values

[1, 1, 2, 1, 2, 4, 1, 3, 6, 11, 1, 3, 8, 17, 32, 1, 4, 11, 26, 54, 102, 1, 4, 13, 35, 82, 172, 331, 1, 5, 17, 48, 120, 272, 567, 1101, 1, 5, 20, 63, 170, 412, 918, 1906, 3724, 1, 6, 24, 81, 235, 607, 1434, 3152, 6518, 12782, 1, 6, 28, 102, 317, 872, 2180, 5049, 10978, 22616, 44444]