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.

A181338 Triangle read by rows: T(n,k) is the number of 2-compositions of n having largest entry k (1<=k<=n).

Table of values

n a(n)
1 2
2 5
3 2
4 12
5 10
6 2
7 29
8 41
9 10
10 2
11 70
12 152
13 46
14 10
15 2
16 169
17 536
18 193
19 46
20 10
21 2
22 408
23 1830
24 770
25 198
26 46
27 10
28 2
29 985
30 6120
31 2972
32 811
33 198
34 46
35 10
36 2
37 2378
38 20178
39 11202
40 3218
41 816
42 198
43 46
44 10
45 2
46 5741
47 65867
48 41481
49 12484
50 3259
51 816
52 198
53 46
54 10
55 2
56 13860

List of values

[2, 5, 2, 12, 10, 2, 29, 41, 10, 2, 70, 152, 46, 10, 2, 169, 536, 193, 46, 10, 2, 408, 1830, 770, 198, 46, 10, 2, 985, 6120, 2972, 811, 198, 46, 10, 2, 2378, 20178, 11202, 3218, 816, 198, 46, 10, 2, 5741, 65867, 41481, 12484, 3259, 816, 198, 46, 10, 2, 13860]