20252
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, -1, 1), (-1, 1, 1), (0, 0, 1), (1, -1, 1), (1, 1, -1)}.at n=9A148480
- Number of length n+1 0..3 arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=6A250272
- T(n,k)=Number of length n+1 0..k arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=42A250277
- Number of length 7+1 0..n arrays with the sum of the squares of adjacent differences multiplied by some arrangement of +-1 equal to zero.at n=2A250282
- Least integer k such that k/2^n > 1/phi, where phi = (1+sqrt(5))/2 = golden ratio.at n=15A293323
- The integer k that minimizes |k/2^n - 1/phi|, where phi = (1+sqrt(5))/2 = golden ratio.at n=15A293324
- a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/(2*k-1))^k.at n=53A350167