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.

A357499 Triangle read by rows: T(n,k) is the length of the longest induced path in the n-dimensional hypercube, such that the end points of the path are at Hamming distance k, 0 <= k <= n.

Table of values

n a(n)
0 0
1 0
2 1
3 0
4 1
5 2
6 0
7 1
8 4
9 3
10 0
11 1
12 6
13 7
14 4
15 0
16 1
17 12
18 13
19 12
20 11
21 0
22 1
23 26
24 25
25 24
26 25
27 24

List of values

[0, 0, 1, 0, 1, 2, 0, 1, 4, 3, 0, 1, 6, 7, 4, 0, 1, 12, 13, 12, 11, 0, 1, 26, 25, 24, 25, 24]

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

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