147476
domain: N
Appears in sequences
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, 0), (0, 1), (1, -1), (1, 0)}.at n=10A151283
- Numbers n such that m + (sum of digits in base-4 representation of m) = n has exactly three solutions.at n=30A230635
- Number of (n+1)X(n+1) 0..1 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically.at n=13A253151