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.

A181365 Triangle read by rows: T(n,k) is the number of 2-compositions of n having least entry equal to k (n >= 1; 0 <= k <= floor(n/2)).

Table of values

n a(n)
1 2
2 6
3 1
4 22
5 2
6 78
7 3
8 1
9 272
10 6
11 2
12 940
13 13
14 2
15 1
16 3232
17 28
18 2
19 2
20 11080
21 58
22 3
23 2
24 1
25 37920
26 118
27 6
28 2
29 2
30 129648
31 239
32 12
33 2
34 2
35 1
36 443008
37 484
38 22
39 2
40 2
41 2
42 1513248
43 979
44 37
45 3
46 2
47 2
48 1
49 5168000
50 1976
51 60
52 6
53 2
54 2
55 2
56 17647552
57 3980
58 97
59 12
60 2
61 2
62 2
63 1
64 60258304
65 8004

List of values

[2, 6, 1, 22, 2, 78, 3, 1, 272, 6, 2, 940, 13, 2, 1, 3232, 28, 2, 2, 11080, 58, 3, 2, 1, 37920, 118, 6, 2, 2, 129648, 239, 12, 2, 2, 1, 443008, 484, 22, 2, 2, 2, 1513248, 979, 37, 3, 2, 2, 1, 5168000, 1976, 60, 6, 2, 2, 2, 17647552, 3980, 97, 12, 2, 2, 2, 1, 60258304, 8004]