|
First 8 terms calculated by Richard Mathar and Jack Brennen.
Each term is odd.
Can it be proved that there always is a positive multiple of each a(n-1) that has exactly n binary 1's? Or is the {a(k)} sequence finite?
a(10) <= 1 + 2^100 + 2^236 + 2^238 + 2^341 + 2^542 + 2^566 + 2^568 + 2^674 + 2^723.
= 441252181048159767719627961769263015304713273001222391692260944948404967249\
52505691843697819270690248905739332527064430387464361936830982164199090227218\
467520354158302900132818171857506562986336159915978303038159847425. - Max Alekseyev, Oct 12 2008
| 