login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321517 Numbers k such that A294902(k) != A321516(k). 1
50, 75, 100, 125, 150, 175, 190, 200, 222, 225, 238, 242, 246, 250, 275, 285, 300, 325, 333, 338, 350, 357, 363, 369, 374, 375, 380, 400, 425, 438, 442, 444, 450, 475, 476, 484, 492, 494, 500, 507, 525, 550, 555, 561, 570, 575, 578, 595, 600, 605, 615, 625 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
A321516[n_] := Length[Select[Most[Divisors[n]], CompositeQ]]; abQ[n_] := DivisorSum[n, Total[IntegerDigits[#, 2]]*(-1)^Boole[#==n]&]>0; A294902[n_] := Length[Select[Most[Divisors[n]], abQ[#] &]]; Select[Range[650], A321516[#] != A294902 [#] &] (* Amiram Eldar, Nov 12 2018 after Jean-François Alcover at A175526 *)
PROG
(PARI) a292257(n) = sumdiv(n, d, (d<n)*hammingweight(d)) \\ after Antti Karttunen in A292257
a294905(n) = (a292257(n) <= hammingweight(n)) \\ after Antti Karttunen in A294905
a294902(n) = sumdiv(n, d, (d<n)*(0==a294905(d))) \\ after Antti Karttunen in A294902
a321516(n) = my(d=divisors(n), i=0); for(k=2, #d-1, if(!ispseudoprime(d[k]), i++)); i
is(n) = a294902(n)!=a321516(n)
CROSSREFS
Sequence in context: A367708 A217857 A071366 * A045165 A261286 A259670
KEYWORD
nonn
AUTHOR
Felix Fröhlich, Nov 12 2018
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:01 EDT 2024. Contains 371265 sequences. (Running on oeis4.)