This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A090457 #18 Apr 19 2024 16:03:01
%S A090457 17,257,277,293,307,401,449,577,641,643,653,673,677,709,1031,1033,
%T A090457 1039,1091,1093,1129,1153,1217,1297,1409,1543,1553,1601,1607,1609,
%U A090457 1613,2053,2063,2081,2083,2087,2089,2099,2113,2179,2309,2341,2371,2593,2609,2633,2647
%N A090457 Primes prime(k) having fewer binary 1's than k.
%H A090457 Amiram Eldar, <a href="/A090457/b090457.txt">Table of n, a(n) for n = 1..10000</a>
%F A090457 A090455(a(n)) > 0.
%t A090457 seq[len_] := Module[{s = {}, p = 2, k = 1, c = 0}, While[c < len, If[Greater @@ DigitCount[{k, p}, 2, 1], c++; AppendTo[s, p]]; k++; p = NextPrime[p]]; s]; seq[50] (* _Amiram Eldar_, Jul 18 2023 *)
%t A090457 Prime[#]&/@Select[Range[500],DigitCount[#,2,1]>DigitCount[Prime[#],2,1]&] (* _Harvey P. Dale_, Apr 19 2024 *)
%o A090457 (PARI) isok(k) = hammingweight(prime(k)) < hammingweight(k);
%o A090457 lista(nn) = for(n=1, nn, if (isok(n), print1(prime(n), ", "))); \\ _Michel Marcus_, Feb 05 2016
%Y A090457 Cf. A000120, A004676, A072439, A014499, A007088, A090433, A090455, A090456.
%K A090457 nonn,base
%O A090457 1,1
%A A090457 _Reinhard Zumkeller_, Dec 01 2003