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.

A373034 Triangle read by rows: T(n,k) is the number of edge subsets E of the n-dimensional hypercube graph such that E contains a path between two given nodes at Hamming distance k, 0 <= k <= n.

Table of values

n a(n)
0 1
1 2
2 1
3 16
4 9
5 7
6 4096
7 2703
8 2334
9 2160
10 4294967296
11 3425712321
12 3245350248
13 3170502909
14 3127853061

List of values

[1, 2, 1, 16, 9, 7, 4096, 2703, 2334, 2160, 4294967296, 3425712321, 3245350248, 3170502909, 3127853061]

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

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