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 A038462 #15 Mar 11 2025 03:45:08
%S A038462 2047,3071,3583,3839,3967,4031,4063,4079,4087,4091,4093,4094,5119,
%T A038462 5631,5887,6015,6079,6111,6127,6135,6139,6141,6142,6655,6911,7039,
%U A038462 7103,7135,7151,7159,7163,7165,7166,7423,7551,7615,7647,7663,7671
%N A038462 Sums of 11 distinct powers of 2.
%H A038462 Ivan Neretin, <a href="/A038462/b038462.txt">Table of n, a(n) for n = 1..10000</a>
%H A038462 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 A038462 Sum_{n>=1} 1/a(n) = 1.386300330514503033229968047555778179200262625510401687087371496738972082061... (calculated using Baillie's irwinSums.m, see Links). - _Amiram Eldar_, Feb 14 2022
%t A038462 Select[Range[8000], DigitCount[#, 2, 1] == 11 &] (* _Amiram Eldar_, Feb 14 2022 *)
%o A038462 (Python)
%o A038462 from itertools import islice
%o A038462 def A038462_gen(): # generator of terms
%o A038462 yield (n:=2047)
%o A038462 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 A038462 A038462_list = list(islice(A038462_gen(),20)) # _Chai Wah Wu_, Mar 10 2025
%Y A038462 Base 2 interpretation of A038453.
%Y A038462 Cf. A000079, A018900, A014311, A014312, A014313, A023688, A023689, A023690, A023691, A038461 (Hamming weight = 1, 2, ..., 10).
%K A038462 nonn,base,easy
%O A038462 1,1
%A A038462 _Olivier Gérard_
%E A038462 Offset changed to 1 by _Ivan Neretin_, Feb 28 2016