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.

This page as a plain text file.
%I A357499 #7 Oct 02 2022 08:34:07
%S A357499 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
%N 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.
%H A357499 Wikipedia, <a href="https://en.wikipedia.org/wiki/Snake-in-the-box">Snake-in-the-box</a>.
%e A357499 Triangle begins:
%e A357499   n\k| 0  1  2  3  4  5  6
%e A357499   ---+--------------------
%e A357499    0 | 0
%e A357499    1 | 0  1
%e A357499    2 | 0  1  2
%e A357499    3 | 0  1  4  3
%e A357499    4 | 0  1  6  7  4
%e A357499    5 | 0  1 12 13 12 11
%e A357499    6 | 0  1 26 25 24 25 24
%Y A357499 Cf. A099155 (row maxima), A357360 (main diagonal).
%K A357499 nonn,tabl,more,hard
%O A357499 0,6
%A A357499 _Pontus von Brömssen_, Oct 01 2022