57684
domain: N
Appears in sequences
- a(n) = 3*binomial(4*n,n)/(n+1).at n=6A007228
- Duplicate of A007228.at n=6A024497
- Alexandrian integers: numbers of the form n = p*q*r such that 1/n = 1/p - 1/q - 1/r for some integers p,q,r.at n=33A147811
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0) and consisting of n steps taken from {(-1, -1), (-1, 1), (-1, 0), (0, 1), (1, -1), (1, 0)}.at n=8A151298
- Array t(n,k) = binomial(n*k, n+1)/n, where n >= 1 and k >= 2, read by ascending antidiagonals.at n=30A241262
- Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302814
- Number of n X 5 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302817
- T(n,k) = number of n X k 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=40A302820
- Number of 5Xn 0..1 arrays with every element equal to 0, 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=4A302823