OFFSET
1,2
COMMENTS
We call these numbers "maxodious".
If a(n) is in the sequence, then 2^k*a(n) is in the sequence. If a(n)==0 (mod 4) is in the sequence, then a(n)+1 is in the sequence. If a(n)==0 (mod 8) is in the sequence, then a(n)+1, a(n)+2 are in the sequence.
LINKS
Peter J. C. Moses, Table of n, a(n) for n = 1..10000
FORMULA
Numbers n such that A038374(n) is odd. - Charles R Greathouse IV, Jan 12 2014
MATHEMATICA
Select[Range[500], OddQ[Max[Map[Count[#, 1]&, Split[IntegerDigits[#, 2]]]]]&] (* Peter J. C. Moses, Mar 29 2013 *)
PROG
(PARI) A038374(n)=n>>=valuation(n, 2); if(n<2, return(n)); my(e=valuation(n+1, 2)); max(e, A038374(n>>e))
is(n)=A038374(n)%2 \\ Charles R Greathouse IV, Jan 12 2014
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Vladimir Shevelev, Mar 29 2013
STATUS
approved