|
%I #8 Feb 18 2024 01:35:48
%S 0,2,4,4,5,6,8,8,8,9,9,10,10,11,12,12,13,14,16,16,16,16,17,17,17,18,
%T 18,18,19,19,20,20,20,21,21,22,22,23,24,24,24,25,25,26,26,27,28,28,29,
%U 30,32,32,32,32,32,33,33,33,33,34,34,34,34,35,35,35,36,36,36,36,37,37,37
%N n appears A023416(n) times (appearances equal number of 0-bits).
%F Sum_{n>=1} (-1)^(n+1)/a(n) = Sum_{n>=1} (-1)^(n+1)/A059009(n) = 0.395592509... . - _Amiram Eldar_, Feb 18 2024
%e The binary representation of 16 is 10000, which has four 0-bits (and one 1-bit), hence 16 appears four times in this sequence (but only once in A100922).
%t Flatten[Table[Table[n, {DigitCount[n, 2, 0]}], {n, 0, 37}]] (* _Amiram Eldar_, Feb 18 2024 *)
%Y Cf. A100922 (n's appearances equal its number of 1-bits), A030530 (n's appearances equal its total number of bits), A023416, A059009.
%K base,easy,nonn
%O 0,2
%A _Rick L. Shepherd_, Nov 21 2004
|
