OFFSET
0,1
COMMENTS
Prime divisors counted without multiplicity. - Harvey P. Dale, Jan 08 2019
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
MAPLE
A076380 := proc(n) local i, j, t, t1, sod, sopd; t := NULL; for i from 2 to n do t1 := i; sod := 0; while t1 <> 0 do sod := sod + (t1 mod 2); t1 := floor(t1/2); od; sopd := 0; j := 1; while ithprime(j) <= i do if i mod ithprime(j) = 0 then sopd := sopd+ithprime(j); fi; j := j+1; od; if sopd mod sod = 0 then t := t, i; fi; od; t; end;
MATHEMATICA
Select[Range[2, 250], Divisible[Total[FactorInteger[#][[All, 1]]], Total[ IntegerDigits[ #, 2]]]&] (* Harvey P. Dale, Jan 08 2019 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Floor van Lamoen, Oct 08 2002
STATUS
approved