login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268383 Least monotonic left inverse of A268412. 3

%I #15 Feb 11 2017 02:25:43

%S 0,0,0,0,0,1,1,1,1,2,3,4,4,5,5,5,5,6,7,8,9,9,10,11,11,12,13,14,14,15,

%T 15,15,15,16,17,18,19,19,20,21,22,22,22,22,23,23,24,25,25,26,27,28,29,

%U 29,30,31,31,32,33,34,34,35,35,35,35,36,37,38,39,39,40,41,42,42,42,42,43,43,44,45,46

%N Least monotonic left inverse of A268412.

%C a(n) = Number of nonzero "balanced evil numbers" (A268412 without its initial zero) in range [0..n].

%H Antti Karttunen, <a href="/A268383/b268383.txt">Table of n, a(n) for n = 0..16384</a>

%H Vladimir Shevelev, <a href="http://arxiv.org/abs/1603.04434">Two analogs of Thue-Morse sequence</a>, arXiv:1603.04434 [math.NT], 2016.

%F a(0) = 0; for n >= 1, a(n) = (1-A268411(n)) + a(n-1).

%F Other identities. For all n >= 0:

%F a(A268412(n)) = n.

%F a(n) = n - A268382(n).

%o (Scheme, with memoization-macro definec)

%o (definec (A268383 n) (if (zero? n) n (+ (- 1 (A268411 n)) (A268383 (- n 1)))))

%o (Python)

%o A268383_list = [0]

%o for i in range(1,10**6):

%o A268383_list.append(A268383_list[-1]+1-len(list(filter(bool,format(i,'b').split('0')))) % 2) # _Chai Wah Wu_, Mar 01 2016

%Y Cf. A268411, A268412, A268382.

%K nonn

%O 0,10

%A _Antti Karttunen_, Feb 05 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 21 01:12 EDT 2024. Contains 375342 sequences. (Running on oeis4.)