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.

A336703 Rectangular array read by antidiagonals. T(n,k) is the number of length k walks from {} to [n] in the digraph representation of the superset/subset relation on P([n]) the powerset of [n], n>=0, k>=0.

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 4
12 4
13 1
14 0
15 1
16 8
17 14
18 8
19 1
20 0
21 1
22 16
23 50
24 46
25 16
26 1
27 0
28 1
29 32
30 178
31 278
32 146
33 32
34 1
35 0
36 1
37 64
38 634
39 1666
40 1454
41 454
42 64
43 1
44 0
45 1
46 128
47 2258
48 9998
49 14230
50 7358
51 1394
52 128
53 1
54 0
55 1
56 256
57 8042
58 59986
59 139750
60 115546
61 36590
62 4246
63 256
64 1
65 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 4, 4, 1, 0, 1, 8, 14, 8, 1, 0, 1, 16, 50, 46, 16, 1, 0, 1, 32, 178, 278, 146, 32, 1, 0, 1, 64, 634, 1666, 1454, 454, 64, 1, 0, 1, 128, 2258, 9998, 14230, 7358, 1394, 128, 1, 0, 1, 256, 8042, 59986, 139750, 115546, 36590, 4246, 256, 1, 0]