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.

A099155 Maximum length of a simple path with no chords in the n-dimensional hypercube, also known as snake-in-the-box problem.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 7
5 13
6 26
7 50
8 98

List of values

[0, 1, 2, 4, 7, 13, 26, 50, 98]