[seqfan] Exponent of highest power of 2 dividing n is equal to exponent of highest power of 3 dividing n
charles.greathouse at case.edu
Fri Sep 2 08:05:11 CEST 2016
Juri-Stepan Gerasimov submitted a nice sequence which turned out to be a
It's not hard to prove that a(n) ~ 5n/2. But I can't find a reasonable
error term. Can anyone help?
For example, a(174142594) = 435356467 is at a record distance of 18 from
the asymptotic at 435356485, and this is suggestive of a logarithmic error
(which is what I would naively expect).
Case Western Reserve University
More information about the SeqFan