42609

Appears in sequences

• 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, 0), (-1, 1, -1), (0, 1, 0), (1, -1, 0), (1, -1, 1)}.at n=10A148649
• a(n) = A170803(n-1) + 2, with a(0) = 1, a(1) = 2.at n=24A170805
• Number of (3+1) X (n+1) arrays of permutations of 0..n*4+3 with each element having directed index change -2,-2 -1,0 0,1 or 1,0.at n=10A264536
• Partial sums of A299268.at n=29A299269
• Number of integer partitions of 2n without a nonempty initial consecutive subsequence summing to n.at n=21A362051
• Number of integer partitions of n without a nonempty initial consecutive subsequence summing to n/2.at n=42A362558
• G.f. satisfies A(x) = 1 + 2*x + x^3*A(x)^3.at n=15A367073