|
%I #19 Feb 18 2024 01:33:36
%S 1,2,3,3,4,5,5,6,6,7,7,7,8,9,9,10,10,11,11,11,12,12,13,13,13,14,14,14,
%T 15,15,15,15,16,17,17,18,18,19,19,19,20,20,21,21,21,22,22,22,23,23,23,
%U 23,24,24,25,25,25,26,26,26,27,27,27,27,28,28,28,29,29,29,29,30,30,30
%N n appears A000120(n) times (appearances equal number of 1-bits).
%C Clearly every positive integer appears at least once in this sequence.
%H Antti Karttunen, <a href="/A100922/b100922.txt">Table of n, a(n) for n = 0..11264</a>
%F a(n) = the least k such that A000788(k) > n. - _Antti Karttunen_, Jun 20 2014
%F Sum_{n>=1} (-1)^(n+1)/a(n) = Sum_{n>=1} (-1)^(n+1)/A000069(n) = 0.67968268... . - _Amiram Eldar_, Feb 18 2024
%e The binary representation of 16 is 10000, which has one 1-bit (and four 0-bits), hence 16 appears once in this sequence (and four times in A100921).
%t Table[Table[n,DigitCount[n,2,1]],{n,30}]//Flatten (* _Harvey P. Dale_, Aug 31 2017 *)
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A100922 (COMPOSE (LEAST-GTE-I 1 1 A000788) 1+))
%Y Cf. A100921 (n's appearances equal its number of 0-bits), A030530 (n's appearances equal its total number of bits), A227737 (n's appearances equal its total number of runs), A000069, A000120, A000788, A163510, A243067.
%K base,easy,nonn
%O 0,2
%A _Rick L. Shepherd_, Nov 21 2004
|
