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.

A027113 Triangular array T given by rows: T(n,0)=1 for n >= 0, T(n,1)=1,T(n,2)=2 for n >= 1 and for n >= 2, T(n,k)=T(n-1,k-3)+T(n-1,k-2)+T(n-1,k-1) for 3<=k<=2n-1, T(n,2n)=T(n-1,2n-3)+T(n-1,2n-2).

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 1
6 1
7 2
8 4
9 3
10 1
11 1
12 2
13 4
14 7
15 9
16 7
17 1
18 1
19 2
20 4
21 7
22 13
23 20
24 23
25 16
26 1
27 1
28 2
29 4
30 7
31 13
32 24
33 40
34 56
35 59
36 39
37 1
38 1
39 2
40 4
41 7
42 13
43 24
44 44
45 77
46 120
47 155
48 154
49 98
50 1
51 1
52 2
53 4
54 7
55 13
56 24
57 44
58 81
59 145
60 241
61 352
62 429
63 407
64 252
65 1
66 1
67 2
68 4
69 7
70 13
71 24

List of values

[1, 1, 1, 2, 1, 1, 2, 4, 3, 1, 1, 2, 4, 7, 9, 7, 1, 1, 2, 4, 7, 13, 20, 23, 16, 1, 1, 2, 4, 7, 13, 24, 40, 56, 59, 39, 1, 1, 2, 4, 7, 13, 24, 44, 77, 120, 155, 154, 98, 1, 1, 2, 4, 7, 13, 24, 44, 81, 145, 241, 352, 429, 407, 252, 1, 1, 2, 4, 7, 13, 24]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.