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.

A167763 Pendular triangle (p=0), read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), otherwise T(n,k) = T(n,n-1-k) + p*T(n-1,k), for n >= k <= 0, with T(n,0) = 1 and T(n,n) = 0^n.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 3, 1, 0, 1, 4, 7, 4, 1, 0, 1, 5, 12, 12, 5, 1, 0, 1, 6, 18, 30, 18, 6, 1, 0, 1, 7, 25, 55, 55, 25, 7, 1, 0, 1, 8, 33, 88, 143, 88, 33, 8, 1, 0, 1, 9, 42, 130, 273, 273, 130, 42, 9, 1, 0, 1, 10, 52, 182, 455, 728, 455, 182, 52, 10, 1, 0]