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.
%I A269371 #8 Mar 06 2016 23:23:41 %S A269371 0,1,1,2,3,3,3,4,5,5,5,6,6,6,6,7,8,8,8,9,9,9,9,10,10,10,11,11,11,11, %T A269371 11,12,13,13,13,14,14,14,14,15,15,15,16,16,16,16,17,17,17,18,18,18,18, %U A269371 19,19,19,19,20,20,20,20,20,20,21,22,22,22,23,23,23,23,24,24,24,25,25,25,25,26,26,26,27,27,27,27,28 %N A269371 Least monotonic left inverse of A179016. %C A269371 a(n) = number of nonzero terms of A179016 <= n. %C A269371 Partial sums of A213719 from its term A213719(1) onward (A213719(0)=1 not included). %H A269371 Antti Karttunen, <a href="/A269371/b269371.txt">Table of n, a(n) for n = 0..16384</a> %F A269371 a(0) = 0, for n > 0, a(n) = a(n-1) + A213719(n). %F A269371 a(n) = A213718(n+1) - 1. %F A269371 Other identities. For all n >= 0: %F A269371 a(A179016(n)) = n. %o A269371 (Scheme, with _Antti Karttunen_'s IntSeq-library, two variants) %o A269371 (definec (A269371 n) (if (zero? n) n (+ (A213719 n) (A269371 (- n 1))))) %o A269371 (define A269371 (LEFTINV-LEASTMONO 0 0 A179016)) %Y A269371 Cf. A179016, A213718, A213719. %Y A269371 Cf. also A071542, A269381, A269401. %K A269371 nonn,base %O A269371 0,4 %A A269371 _Antti Karttunen_, Mar 05 2016