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.

A105147 Triangular array read by rows: T(n,k) = number of compositions of n having smallest part equal to k.

Table of values

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

List of values

[1, 1, 1, 3, 0, 1, 6, 1, 0, 1, 13, 2, 0, 0, 1, 27, 3, 1, 0, 0, 1, 56, 5, 2, 0, 0, 0, 1, 115, 9, 2, 1, 0, 0, 0, 1, 235, 15, 3, 2, 0, 0, 0, 0, 1, 478, 25, 5, 2, 1, 0, 0, 0, 0, 1, 969, 42, 8, 2, 2, 0, 0, 0, 0, 0, 1, 1959, 70, 12, 3, 2, 1, 0, 0, 0, 0, 0, 1, 3952, 116, 18, 5, 2, 2, 0, 0, 0, 0, 0, 0, 1]