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 A038461 #29 Mar 11 2025 03:45:57
%S A038461 1023,1535,1791,1919,1983,2015,2031,2039,2043,2045,2046,2559,2815,
%T A038461 2943,3007,3039,3055,3063,3067,3069,3070,3327,3455,3519,3551,3567,
%U A038461 3575,3579,3581,3582,3711,3775,3807,3823,3831,3835,3837,3838,3903
%N A038461 Sums of 10 distinct powers of 2.
%H A038461 Ivan Neretin, <a href="/A038461/b038461.txt">Table of n, a(n) for n = 1..10000</a>
%H A038461 Robert Baillie, <a href="http://arxiv.org/abs/0806.4410">Summing the curious series of Kempner and Irwin</a>, arXiv:0806.4410 [math.CA], 2008-2015. See p. 18 for Mathematica code irwinSums.m.
%F A038461 Sum_{n>=1} 1/a(n) = 1.386312271262110321181505974797071257205562524228381227122302929089588534920... (calculated using Baillie's irwinSums.m, see Links). - _Amiram Eldar_, Feb 14 2022
%t A038461 Select[Range[4000], DigitCount[#, 2, 1] == 10 &] (* _Amiram Eldar_, Feb 14 2022 *)
%o A038461 (PARI) isok(n) = hammingweight(n) == 10; \\ _Michel Marcus_, Feb 29 2016
%o A038461 (Python)
%o A038461 from itertools import islice
%o A038461 def A038461_gen(): # generator of terms
%o A038461 yield (n:=1023)
%o A038461 while True: yield (n:=n^((a:=-n&n+1)|(a>>1)) if n&1 else ((n&~(b:=n+(a:=n&-n)))>>a.bit_length())^b)
%o A038461 A038461_list = list(islice(A038461_gen(),20)) # _Chai Wah Wu_, Mar 10 2025
%Y A038461 Base 2 interpretation of A038452.
%Y A038461 Cf. A000079, A018900, A014311, A014312, A014313, A023688, A023689, A023690, A023691 (Hamming weight = 1, 2, ..., 9).
%K A038461 nonn,base,easy
%O A038461 1,1
%A A038461 _Olivier Gérard_
%E A038461 Offset changed to 1 by _Ivan Neretin_, Feb 28 2016