49225

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, -1), (-1, 0, 0), (0, -1, 0), (0, 1, -1), (1, 0, 1)}.at n=10A148794
• Number of (n+1) X (n+1) 0..5 arrays with every 2 X 2 subblock commuting with each of its horizontal and vertical 2 X 2 subblock neighbors.at n=2A186485
• T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=12A186486
• T(n,m)=Number of (n+1)X4 0..m arrays with every 2X2 subblock commuting with each of its horizontal and vertical 2X2 subblock neighbors.at n=23A188058
• Antidiagonal sums of the convolution array A213576.at n=14A213578
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f.: exp(Sum_{j>=1} j^(k-1)*A000041(j)*x^j).at n=49A293796
• Triangle read by rows in which T(n,k) is the number of length k chains from (0,0) to (n,n) of the poset [n] X [n] ordered by the product order, 0 <= k <= 2n, n>=0.at n=54A316649
• a(n) = smallest number with the property that the split-and-multiply technique (see A361338) in base n can produce all n single-digit numbers.at n=12A361340
• Numbers k such that the sum of the numbers from 1 to k and that from 1 to k+1 share the same sum of divisors.at n=25A375819
• Numbers k such that s(k) = s(k+2), where s(k) is the sum of odd divisors of k (A000593).at n=13A387920