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.

A217765 Square array T, read by antidiagonals: T(n,k) = 0 if n-k >=3 or if k-n >= 6, T(2,0) = T(1,0) = T(0,0) = T(0,1) = T(0,2) = T(0,3) = T(0,4) = T(0,5) = 1, T(n,k) = T(n-1,k) + T(n,k-1).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 1
6 1
7 3
8 3
9 0
10 1
11 4
12 6
13 3
14 0
15 1
16 5
17 10
18 9
19 0
20 0
21 0
22 6
23 15
24 19
25 9
26 0
27 0
28 0
29 6
30 21
31 34
32 28
33 0
34 0
35 0
36 0
37 0
38 27
39 55
40 62
41 28
42 0
43 0
44 0
45 0
46 0
47 27
48 82
49 117
50 90
51 0
52 0
53 0
54 0
55 0
56 0
57 0
58 109
59 199
60 207
61 90
62 0
63 0
64 0
65 0
66 0
67 0
68 0
69 109
70 308
71 406
72 297
73 0
74 0
75 0
76 0

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 3, 0, 1, 4, 6, 3, 0, 1, 5, 10, 9, 0, 0, 0, 6, 15, 19, 9, 0, 0, 0, 6, 21, 34, 28, 0, 0, 0, 0, 0, 27, 55, 62, 28, 0, 0, 0, 0, 0, 27, 82, 117, 90, 0, 0, 0, 0, 0, 0, 0, 109, 199, 207, 90, 0, 0, 0, 0, 0, 0, 0, 109, 308, 406, 297, 0, 0, 0, 0]

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

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