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.

A209936 Triangle of multiplicities of k-th partition of n corresponding to sequence A080577. Multiplicity of a given partition of n into k parts is the number of ways parts can be selected from k distinguishable bins. See the example.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 6
6 1
7 4
8 12
9 6
10 12
11 1
12 5
13 20
14 20
15 30
16 30
17 20
18 1
19 6
20 30
21 30
22 60
23 15
24 120
25 60
26 20
27 90
28 30
29 1
30 7
31 42
32 42
33 105
34 42
35 210
36 140
37 105
38 105
39 420
40 105
41 140
42 210
43 42
44 1
45 8
46 56
47 56
48 168
49 56
50 336
51 280
52 28
53 336
54 168
55 840
56 280
57 168
58 420
59 840
60 1120
61 168
62 70
63 560
64 420
65 56
66 1

List of values

[1, 2, 1, 3, 6, 1, 4, 12, 6, 12, 1, 5, 20, 20, 30, 30, 20, 1, 6, 30, 30, 60, 15, 120, 60, 20, 90, 30, 1, 7, 42, 42, 105, 42, 210, 140, 105, 105, 420, 105, 140, 210, 42, 1, 8, 56, 56, 168, 56, 336, 280, 28, 336, 168, 840, 280, 168, 420, 840, 1120, 168, 70, 560, 420, 56, 1]