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 A064548 #21 Dec 14 2024 17:45:42
%S A064548 1,2,3,4,5,7,9,11,15,16,19,20,23,24,26,31,33,34,39,41,44,47,48,49,53,
%T A064548 63,67,68,69,74,79,83,89,95,97,98,99,104,107,127,132,135,137,139,144,
%U A064548 146,149,152,159,160,164,167,179,191,194,195,197,199,209,215,242,255
%N A064548 Numbers k for which the sum of the binary digits equals the number of prime factors of k + 1 counted with multiplicity.
%C A064548 This sequence becomes rare for large n: 15 values between 100000 and 101024 and none between 1000000 and 1001024.
%C A064548 Numbers k such that A000120(k) = A001222(k+1). - _Franklin T. Adams-Watters_, Aug 17 2012
%H A064548 Harry J. Smith, <a href="/A064548/b064548.txt">Table of n, a(n) for n = 1..1000</a>
%e A064548 8 is absent since 8 in binary is (1000) with sum=1, while (8+1) has 2 factors.
%t A064548 Select[ Range[ 1024 ], DigitCount[ #, 2, 1 ]===(Plus@@(Last/@FactorInteger[ #+1 ]))& ]
%t A064548 Select[Range[300],DigitCount[#,2,1]==PrimeOmega[#+1]&] (* _Harvey P. Dale_, Mar 11 2023 *)
%o A064548 (PARI) isok(k) = { hammingweight(k) == bigomega(k+1) } \\ _Harry J. Smith_, Sep 18 2009
%Y A064548 Cf. A000120, A001222, A058061, A064547.
%K A064548 nonn
%O A064548 1,2
%A A064548 _Wouter Meeussen_, Oct 09 2001