275568
domain: N
Appears in sequences
- Number of walks on square lattice that start and end at origin after 2n steps, not touching origin at intermediate stages.at n=6A054474
- Number of strings of numbers x(i=1..n) in 0..7 with sum i^4*x(i) equal to n^4*7.at n=11A184346
- a(n) = Pell(n)*A034896(n) for n >= 1, with a(0)=1, where A034896 lists the number of solutions to a^2 + b^2 + 3*c^2 + 3*d^2 = n.at n=11A209451
- a(n) = Pell(n)*A028594(n) for n>=1, with a(0)=1, where A028594 lists the coefficients in (theta_3(x)*theta_3(7*x)+theta_2(x)*theta_2(7*x))^2.at n=11A209456
- Triangular array read by rows. T(n,k) is the number of square lattice walks that start and end at the origin after 2n steps having k primitive loops; n>=1, 1<=k<=n.at n=15A227997
- Number A(n,k) of k-dimensional cubic lattice walks with 2n steps from origin to origin and avoiding early returns to the origin; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=42A361397