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.

A090641 Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 3
9 1
10 1
11 4
12 6
13 3
14 0
15 1
16 5
17 10
18 7
19 0
20 0
21 1
22 6
23 15
24 13
25 1
26 0
27 0
28 1
29 7
30 21
31 22
32 3
33 0
34 0
35 0
36 1
37 8
38 28
39 34
40 7
41 0
42 0
43 0
44 0
45 1
46 9
47 36
48 50
49 13
50 0
51 0
52 0
53 0
54 0
55 1
56 10
57 45
58 70
59 23
60 0
61 0
62 0
63 0
64 0
65 0
66 1
67 11
68 55
69 95
70 37
71 0
72 0
73 0
74 0
75 0
76 0
77 0
78 1
79 12
80 66
81 125
82 57
83 1
84 0
85 0
86 0

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 3, 0, 1, 5, 10, 7, 0, 0, 1, 6, 15, 13, 1, 0, 0, 1, 7, 21, 22, 3, 0, 0, 0, 1, 8, 28, 34, 7, 0, 0, 0, 0, 1, 9, 36, 50, 13, 0, 0, 0, 0, 0, 1, 10, 45, 70, 23, 0, 0, 0, 0, 0, 0, 1, 11, 55, 95, 37, 0, 0, 0, 0, 0, 0, 0, 1, 12, 66, 125, 57, 1, 0, 0, 0]