cp's OEIS Frontend

A266113 a(n) = number of integers k <= n which are least siblings in A263267-tree (see A266114).

%I A266113 #9 Dec 23 2015 14:11:29
%S A266113 1,1,2,2,3,4,5,6,7,7,8,8,9,10,10,10,11,12,13,14,14,15,16,17,18,18,19,
%T A266113 19,20,20,21,22,22,23,24,24,25,26,26,27,28,28,29,30,30,31,32,32,33,34,
%U A266113 35,35,36,36,36,37,38,39,40,40,41,42,42,42,43,43,44,45,45,45,46,47,48,49,49,49,50,50,51,51,52,53,54,55,55
%N A266113 a(n) = number of integers k <= n which are least siblings in A263267-tree (see A266114).
%C A266113 Partial sums of A266112.
%C A266113 The least monotonic left inverse of A266114.
%H A266113 Antti Karttunen, <a href="/A266113/b266113.txt">Table of n, a(n) for n = 1..124340</a>
%F A266113 a(1) =  1; for n  > 1, a(n) = A266112(n) + a(n-1).
%F A266113 Other identities. For all n >= 1:
%F A266113 a(A266114(n)) = n. [Works as a left inverse of A266114].
%o A266113 (Scheme, with memoization-macro definec)
%o A266113 (definec (A266113 n) (if (= 1 n) n (+ (A266112 n) (A266113 (- n 1)))))
%Y A266113 Cf. A000005, A263267, A266112, A266114.
%K A266113 nonn
%O A266113 1,3
%A A266113 _Antti Karttunen_, Dec 21 2015