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.
%I A334359 #6 Feb 16 2025 08:34:00 %S A334359 1,1,4,354,179185930,258823757396708888836788 %N A334359 Number of stable partitions of the n-hypercube graph. %C A334359 A stable partition is a partition of the vertices into sets so that no two vertices in a set are adjacent in the graph. %C A334359 Equivalently, a(n) is the number of vertex colorings of the n-hypercube graph with any number of unlabeled colors. The vertices are not interchangeable. %H A334359 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HypercubeGraph.html">Hypercube Graph</a> %e A334359 The a(2) = 4 stable partitions of the 2-dimensional hypercube are: %e A334359 1---2 1---2 1---2 1---2 %e A334359 | | | | | | | | %e A334359 2---1 2---3 3---1 3---4 %Y A334359 Row sums of A334159. %K A334359 nonn %O A334359 0,3 %A A334359 _Andrew Howroyd_, Apr 25 2020