63815

Appears in sequences

• The number of degree sequences with degree sum 2n representable by a non-separable graph (with multiple edges allowed).at n=27A147877
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (1, -1, -1), (1, 1, 0), (1, 1, 1)}.at n=8A150918