34008
domain: N
Appears in sequences
- Number of complementary pairs of circulant digraphs on n nodes.at n=19A054930
- 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), (0, 1, -1), (0, 1, 1), (1, 0, 1)}.at n=8A150547
- Numbers k such that 6^k - 5^k - 4^k - 3^k - 2^k - 1 is prime.at n=11A240507
- Coefficient of y^0 in G(x,y)^4 where G(x,y) = Sum_{n=-oo..+oo} (1-x^n)^n * x^n * y^n.at n=30A263189
- Solution of the complementary equation a(n) = 3*a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=17A295138
- Table read by antidiagonals: T(h,n) is the number of n-step self avoiding walks on a 3D cubic lattice confined inside a box of size 2h X 2h X 2h where the walk starts at the center of the box.at n=29A337023