Code Golf: Pernicious Numbers about fh-250-puzzles

[VikramGoyal23]

121 bytes
for i in range(51):
x=sum([int(i) for i in str(bin(i)[2:])])
flag=0
if x in {2,3,5,7}:
print(i)

[tanyyyming]

for i in range(51):
    s = sum(map(int,"{0:b}".format(i)))
    if (all(False for i in range(2,s) if s % i == 0) and not s < 2):
        print(s)

63 bytes

[joeng03]

def isprime(n):
    return (all(False for i in range(2,n) if n % i == 0) and not n < 2)
for i in range(51):
    if isprime(sum(map(int,bin(i)[2:]))):
        print(i+1)

[sg-incognito]

def p(n): return (all(False for i in range(2,n) if n%i == 0) and not n<2)
i,c = 1,0
while c<25:
    if (p(bin(i).count('1'))):
        print(i, end=' ')
        c+=1    
    i+=1

196 bytes

[joshcangit]

#include <stdio.h>
typedef unsigned uint;uint is_pern(uint n){uint c = 2693408940u;while (n) c >>= 1, n &= (n - 1);return c & 1;}int main(){uint i, c;for (i = c = 0; c < 25; i++)if (is_pern(i))printf("%u ", i), ++c;}

The size is 217 bytes.

[joeng03]

is_prime = lambda n: all(n % i != 0 for i in range(2, n)) and n > 1
cnt = sum(is_prime(sum(map(int, bin(i)[2:]))) for i in range(51))