A357499 - OEIS

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.

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

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

0,6

LINKS

Table of n, a(n) for n=0..27.

Wikipedia, Snake-in-the-box.

EXAMPLE

Triangle begins:

n\k| 0 1 2 3 4 5 6

---+--------------------

0 | 0

1 | 0 1

2 | 0 1 2

3 | 0 1 4 3

4 | 0 1 6 7 4

5 | 0 1 12 13 12 11

6 | 0 1 26 25 24 25 24

CROSSREFS

Cf. A099155 (row maxima), A357360 (main diagonal).

Sequence in context: A160648 A124912 A138752 * A368506 A342133 A358050

Adjacent sequences: A357496 A357497 A357498 * A357500 A357501 A357502

KEYWORD

nonn,tabl,more,hard

AUTHOR

Pontus von Brömssen, Oct 01 2022

STATUS

approved