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 A370596 #8 Feb 23 2024 11:03:31
%S A370596 4,8,12,20,24,28,32,36,40,44,52,56,60,68,72,76,84,88,92,96,100,104,
%T A370596 108,116,120,124,128,132,136,140,148,152,156,160,164,168,172,180,184,
%U A370596 188,196,200,204,212,216,220,224,228,232,236,244,248,252,260,264,268,276
%N A370596 Numbers k such that A007814(k) is a prime number.
%C A370596 Numbers whose binary representation has a prime number of trailing 0's.
%C A370596 a(n)-1 is the sequence of numbers whose binary representation has a prime number of trailing 1's.
%C A370596 Numbers of the form (2^(p+1))*k + 2^p = 2^p * (2*k + 1), where p is prime and k >= 0.
%C A370596 All the terms are divisible by 4.
%C A370596 The asymptotic density of this sequence is Sum_{p prime} 1/2^(p+1) = 0.20734125492555583012... = A051006 / 2.
%H A370596 Amiram Eldar, <a href="/A370596/b370596.txt">Table of n, a(n) for n = 1..10000</a>
%t A370596 Select[Range[300], PrimeQ[IntegerExponent[#, 2]] &]
%o A370596 (PARI) is(n) = isprime(valuation(n, 2));
%Y A370596 Cf. A007814, A051006, A359794.
%Y A370596 Subsequences: A017113, A051062.
%K A370596 nonn,easy
%O A370596 1,1
%A A370596 _Amiram Eldar_, Feb 23 2024