A261093 - OEIS

%I #8 Aug 10 2015 07:33:01

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

%T 18,19,20,20,20,20,21,22,23,23,24,25,25,26,27,28,28,28,29,30,31,31,32,

%U 33,33,33,33,34,35,36,36,37,38,38,39,40,41,41,41,42,43,44,44,45,46,46,46,47,48,49,49,50,51,51,52,53,54,54,54,54,54,55

%N a(n) = number of nonzero terms of A219640 <= n.

%C Each n occurs A261095(n) times.

%H Antti Karttunen, <a href="/A261093/b261093.txt">Table of n, a(n) for n = 0..6765</a>

%F a(n) = the largest k such that A219640(k) <= n.

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

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

%o (Scheme, with _Antti Karttunen_'s IntSeq-library)

%o (define A261093 (LEFTINV-LEASTMONO-NC2NC 0 0 A219640))

%Y Left inverse of A219640. (A261094 gives the zeroed version).

%Y Partial sums of A261092 summed from its term a(1) onward.

%K nonn

%O 0,3

%A _Antti Karttunen_, Aug 08 2015