43640
domain: N
Appears in sequences
- a(n) = Sum_{i=0..n} Sum_{j=0..n} (i XOR j), where XOR is the binary logical exclusive-or operator.at n=40A224923
- If a(n) is not a square, then a(n+1) = a(n) + a(n-1), else a(n+1) is the smallest positive integer not occurring earlier.at n=32A268133
- Numbers k such that A284644(k) = A284644(k-1) = A284644(k-2) = A284644(k-3).at n=10A287118
- Number of squares and rectangles in the interior of the square with vertices (n,0), (0,n), (-n,0) and (0,-n) in a square (x,y)-grid.at n=15A330805
- a(0) = a(1) = 1; a(n+2) = Sum_{k=0..n} (binomial(n,k) mod 2) * a(k).at n=33A331520
- Coefficients in the power series A(x) such that: 4 = Sum_{n=-oo..+oo} x^(2*n+1) * (1 - x^n)^(n+1) * A(x)^n.at n=5A357404