36064
domain: N
Appears in sequences
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=16A049929
- Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,4}.at n=28A079964
- Number of (w,x,y,z) with all terms in {1,...,n} and w < (geometric mean of x,y,z).at n=17A212141
- Triangle read by rows: T(m,n) is the Szeged index of the grid graph P_m X P_n (1 <= n <= m).at n=33A245826
- a(n) = 2*a(n-2) + 2*a(n-3) for n >= 3, where a(0) = 2, a(2) = 4, a(3) = 7.at n=17A287439
- Expansion of (1 + x^2 - x^3)/((1 + x^2 - x^3)^2 - 4*x^2).at n=20A376726