cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A268382 Partial sums of A268411; the least monotonic left inverse of A268415.

This page as a plain text file.
%I A268382 #11 Feb 11 2017 02:25:20
%S A268382 0,1,2,3,4,4,5,6,7,7,7,7,8,8,9,10,11,11,11,11,11,12,12,12,13,13,13,13,
%T A268382 14,14,15,16,17,17,17,17,17,18,18,18,18,19,20,21,21,22,22,22,23,23,23,
%U A268382 23,23,24,24,24,25,25,25,25,26,26,27,28,29,29,29,29,29,30,30,30,30,31,32,33,33,34,34,34,34,35,36
%N A268382 Partial sums of A268411; the least monotonic left inverse of A268415.
%C A268382 a(n) = Number of "balanced odious numbers" (A268415) in range [0..n].
%H A268382 Antti Karttunen, <a href="/A268382/b268382.txt">Table of n, a(n) for n = 0..16384</a>
%H A268382 Vladimir Shevelev, <a href="http://arxiv.org/abs/1603.04434">Two analogs of Thue-Morse sequence</a>, arXiv:1603.04434 [math.NT], 2016.
%F A268382 a(0) = 0; for n >= 1, a(n) = A268411(n) + a(n-1).
%F A268382 Other identities. For all n >= 1:
%F A268382 a(A268415(n)) = n.
%F A268382 a(n) = n - A268383(n).
%o A268382 (Scheme, with memoizing-macro definec)
%o A268382 (definec (A268382 n) (if (zero? n) n (+ (A268411 n) (A268382 (- n 1)))))
%Y A268382 Partial sums of A268411.
%Y A268382 Cf. A268415, A268383.
%K A268382 nonn
%O A268382 0,3
%A A268382 _Antti Karttunen_, Feb 05 2016