24959

Appears in sequences

• Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away.at n=10A005666
• Number of 10's in all partitions of n.at n=46A024794
• 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, -1), (1, 0, 1), (1, 1, -1)}.at n=9A148961
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 2 5 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 2 5 6 or 7.at n=9A252416
• Triangle read by rows in which T(n,k) is the number of permutations avoiding 132 of length n with an independent set of size k in its coregraph.at n=45A262370
• Number of partitions of n with rank 4 or higher (the rank of a partition is the largest part minus the number of parts).at n=43A363231
• a(n) = numerator(Sum_{k=1..n} d(k+1)/d(k)), where d is the number of divisors function.at n=46A386925