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