43806
domain: N
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, 0, 0), (-1, 0, 1), (1, -1, 0), (1, 0, 0), (1, 1, -1)}.at n=10A148617
- Triangle read by rows: T(n,k) = t(n,k) + t(n,n-k), where t(n,k) = 2*(n!/k!)*(2*(n + k) - 1).at n=30A154987
- Triangle read by rows: T(n,k) = t(n,k) + t(n,n-k), where t(n,k) = 2*(n!/k!)*(2*(n + k) - 1).at n=33A154987
- A triangle of polynomial coefficients:p(x,n)=Sum[(k + 1)^n*Binomial[x, k], {k, 0, Infinity}]/2^(x - n).at n=49A176667
- a(n) = A306896(n)/6.at n=17A306897
- Numbers k such that 477*2^k+1 is prime.at n=38A319487
- Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 4n.at n=33A334057