51955
domain: N
Appears in sequences
- a(n) is the smallest integer k such that floor((3/2)^k)/floor((3/2)^n) is an integer greater than 1.at n=31A065644
- Number of 7-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-bishop's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=10A187611
- Number of arrays of -2..2 integers x(1..n) with every x(i) in a subsequence of length 1, 2 or 3 with sum zero.at n=8A193696
- T(n,k)=Number of arrays of -k..k integers x(1..n) with every x(i) being in a subsequence of length 1, 2 or 3 with sum zero.at n=53A193702
- Number of distinct sums i^3 + j^3 + k^3 + l^3 for 0<=i<=j<=k<=l<=n.at n=36A374711