26589

Appears in sequences

• a(n) = (2+n)*2^n-2-3*n.at n=10A131438
• 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, 0, -1), (1, 0, 1), (1, 1, 0), (1, 1, 1)}.at n=7A151214
• Number of nX4 array permutations with each element not moving, or moving one space N, SW or SE.at n=6A189430
• T(n,k)=Number of nXk array permutations with each element not moving, or moving one space N, SW or SE.at n=51A189435
• Number of 7Xn array permutations with each element not moving, or moving one space N, SW or SE.at n=3A189439
• Number of Dyck n-paths all of whose ascents have lengths equal to 1 (mod 6).at n=17A212386
• Number of order-preserving (monotone) functions from the power set of 1 = {0} to the power set of n = {0, ..., n-1}.at n=8A246472
• Number of length n+4 0..6 arrays with every five consecutive terms having four times some element equal to the sum of the remaining four.at n=11A249654
• Number of oriented circulant graphs of order n up to Cayley isomorphism.at n=24A283189
• Number of ways to split a strict integer partition of n into contiguous subsequences all having different sums.at n=42A336132
• a(n) = number of isogeny classes of p-divisible groups of abelian varieties of dimension n over an algebraically closed field of characteristic p (for any fixed prime p).at n=27A361721