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.

A027082 Irregular triangular array: T(n,0) = 1 for n >= 1; T(n,1) = T(n,2) = 1 for n >= 1; T(n,k) = T(n-1,k-3) + T(n-1,k-2) + T(n-1,k-1) for 3 <= k <= 2n-1 and n >= 2; and T(n,2n) = T(n-1,2n-3) + T(n-1,2n-2) for n >= 2.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 1
5 1
6 1
7 3
8 2
9 1
10 1
11 1
12 3
13 5
14 6
15 5
16 1
17 1
18 1
19 3
20 5
21 9
22 14
23 16
24 11
25 1
26 1
27 1
28 3
29 5
30 9
31 17
32 28
33 39
34 41
35 27
36 1
37 1
38 1
39 3
40 5
41 9
42 17
43 31
44 54
45 84
46 108
47 107
48 68
49 1
50 1
51 1
52 3
53 5
54 9
55 17
56 31
57 57
58 102
59 169
60 246
61 299
62 283
63 175
64 1
65 1
66 1
67 3
68 5
69 9
70 17
71 31
72 57

List of values

[1, 1, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 3, 5, 6, 5, 1, 1, 1, 3, 5, 9, 14, 16, 11, 1, 1, 1, 3, 5, 9, 17, 28, 39, 41, 27, 1, 1, 1, 3, 5, 9, 17, 31, 54, 84, 108, 107, 68, 1, 1, 1, 3, 5, 9, 17, 31, 57, 102, 169, 246, 299, 283, 175, 1, 1, 1, 3, 5, 9, 17, 31, 57]

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

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