|
%I #9 Sep 26 2016 21:44:40
%S 0,1,2,4,5,6,8,9,10,12,13,16,17,18,20,21,22,24,25,26,28,32,33,34,36,
%T 37,38,40,41,42,44,45,48,49,50,52,53,54,56,57,58,60,64,65,66,68,69,70,
%U 72,73,74,76,77,80,81,82,84,85,86,88,89,90,92,96,97,98,100,101,102,104,105,106,108,109,112,113,114,116,117,118,120
%N Numbers n for which A277017(n) = 0; range of A277022 sorted into ascending order.
%C Numbers such that no run of 1-bits has length >= A000040(1 + the total number of 0-bits anywhere right of that run in the binary expansion of n).
%C Indexing starts from zero as a(0) = 0 is a special case in this sequence.
%H Antti Karttunen, <a href="/A277018/b277018.txt">Table of n, a(n) for n = 0..10000</a>
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F Other identitities:
%F A129251(A005940(1+a(n))) = 0 for all n.
%e 60 ("111100" in binary, A007088) is present as 4 < prime(2+1) = 5.
%o (Scheme, with _Antti Karttunen_'s IntSeq-library)
%o (define A277018 (ZERO-POS 0 0 A277017))
%Y Complement: A277019.
%Y Positions of zeros in A277017.
%Y Sequence A277022 sorted into ascending order.
%Y Cf. A000040, A005940, A007088, A129251.
%Y Differs from its subsequence of A277008 for the first time at n=41, where a(41)=60, a value which is missing from A277008.
%K nonn,base
%O 0,3
%A _Antti Karttunen_, Sep 26 2016
|
