|
%I #24 Jul 26 2022 17:47:48
%S 1,3,6,12,18,30,60,90,120,180,360,540,720,1080,1440,2160,3780,4320,
%T 6120,7560,8640,12240,15120,24480,27720,30240,36720,48960,50400,55440,
%U 73440,83160,110880,128520,138600,166320,221760,257040,277200,332640,471240,514080,554400
%N Positions of records in A356018, i.e., integers whose number of evil divisors sets a new record.
%C Corresponding records of number of evil divisors are 0, 1, 2, 3, 4, 6, 9, 10, 12, 15, ...
%H David A. Corneth, <a href="/A356020/b356020.txt">Table of n, a(n) for n = 1..189</a>
%e 60 is in the sequence because A356018(60) = 9 is larger than any earlier value in A356018.
%t f[n_] := DivisorSum[n, 1 &, EvenQ[DigitCount[#, 2, 1]] &]; fm = -1; s = {}; Do[If[(fn = f[n]) > fm, fm = fn; AppendTo[s, n]], {n, 1, 10^5}]; s (* _Amiram Eldar_, Jul 24 2022 *)
%o (PARI) upto(n) = my(res = List(), r=-1); forfactored(i=1, n, if(numdiv(i[2]) > r, d = divisors(i[2]); c=sum(j=1, #d, isevil(d[j])); if(c>r, r=c; listput(res,i[1])))); res
%o isevil(n) = bitand(hammingweight(n), 1)==0 \\ _David A. Corneth_, Jul 24 2022
%o (Python)
%o from sympy import divisors
%o from itertools import count, islice
%o def c(n): return bin(n).count("1")&1 == 0
%o def f(n): return sum(1 for d in divisors(n, generator=True) if c(d))
%o def agen(record=-1):
%o for k in count(1):
%o if f(k) > record: record = f(k); yield k
%o print(list(islice(agen(), 40))) # _Michael S. Branicky_, Jul 24 2022
%Y Cf. A001969, A093688, A093696, A356018, A356019.
%Y Similar sequences: A093036, A093037, A330815, A350756, A355969.
%K nonn,base
%O 1,2
%A _Bernard Schott_, Jul 24 2022
%E More terms from _Amiram Eldar_, Jul 24 2022
|
