|
%I #12 May 13 2015 15:44:12
%S 0,1,1,1,2,2,2,3,3,4,4,4,5,5,5,5,5,6,7,7,7,8,8,9,10,11,11,12,12,12,13,
%T 13,13,13,14,15,15,15,16,16,16,17,18,18,18,18,18,18,18,19,19,19,20,21,
%U 22,23,23,24,24,24,25,25,25,25,26,27,27,27,28,28,29,29,29,30,31,32,33,34,34,34,34,35,36,37,37,37,37,37,37,37,38
%N a(n) = number of odd numbers in range 0 .. n of A233271, the infinite trunk of inverted binary beanstalk.
%C a(0) = 0; and for n >= 1: a(n) = the largest number k such that A257803(k) <= n.
%H Antti Karttunen, <a href="/A257807/b257807.txt">Table of n, a(n) for n = 0..16405</a>
%F a(0) = 0; for n >= 1, a(n) = A257800(n) + a(n-1).
%F Other identities:
%F For all n >= 0, a(n) = A257808(n) - A257806(n).
%F For all n >= 1, a(A257803(n)) = n. [This sequence works as a left inverse of injection A257803.]
%o (Scheme, with memoization-macro definec)
%o (definec (A257807 n) (if (zero? n) n (+ (A257800 n) (A257807 (- n 1)))))
%Y Partial sums of A257800.
%Y Cf. A233271, A257803, A257806, A257808.
%K nonn
%O 0,5
%A _Antti Karttunen_, May 12 2015
|
