107489

Appears in sequences

• In lunar arithmetic in base 2, the number of divisors of the number 11...1101 (n digits, the binary expansion of 2^n-3).at n=23A188288
• In base-2 lunar arithmetic, out of all odd numbers of length n, it appears that 111..1 (with n ones) has the most lunar divisors; the sequence gives the number of lunar divisors of the runner-up.at n=20A188524
• Imaginary parts of the recursive sequence a(n+2) = Sum_{k=0..n} binomial(n,k)*a(k)*a(n+1-k), with a(0)=1, a(1)=i.at n=11A289083