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.

A373423 Array read by ascending antidiagonals: T(n, k) = [x^k] cf(n) where cf(0) = 1, cf(1) = -1/(x - 1), and for n > 1 is cf(n) = ~( ~x - 1/(~x - 1/(~x - 1/(~x - 1/(~x - ... 1/(~x + 1))))...) ) where '~' is '-' if n is even, and '+' if n is odd, and x appears n times in the expression.

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 1
13 1
14 0
15 1
16 4
17 3
18 1
19 1
20 0
21 1
22 5
23 6
24 5
25 1
26 1
27 0
28 1
29 6
30 10
31 14
32 8
33 1
34 1
35 0
36 1
37 7
38 15
39 30
40 31
41 13
42 1
43 1
44 0
45 1
46 8
47 21
48 55
49 85
50 70
51 21
52 1
53 1
54 0
55 1
56 9
57 28
58 91
59 190
60 246
61 157
62 34
63 1
64 1
65 0
66 1
67 10
68 36
69 140
70 371
71 671
72 707
73 353
74 55
75 1
76 1
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 1, 1, 0, 1, 4, 3, 1, 1, 0, 1, 5, 6, 5, 1, 1, 0, 1, 6, 10, 14, 8, 1, 1, 0, 1, 7, 15, 30, 31, 13, 1, 1, 0, 1, 8, 21, 55, 85, 70, 21, 1, 1, 0, 1, 9, 28, 91, 190, 246, 157, 34, 1, 1, 0, 1, 10, 36, 140, 371, 671, 707, 353, 55, 1, 1, 0]