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 A261093 #8 Aug 10 2015 07:33:01 %S A261093 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 A261093 18,19,20,20,20,20,21,22,23,23,24,25,25,26,27,28,28,28,29,30,31,31,32, %U A261093 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 A261093 a(n) = number of nonzero terms of A219640 <= n. %C A261093 Each n occurs A261095(n) times. %H A261093 Antti Karttunen, <a href="/A261093/b261093.txt">Table of n, a(n) for n = 0..6765</a> %F A261093 a(n) = the largest k such that A219640(k) <= n. %F A261093 Other identities. For all n >= 0: %F A261093 a(A219640(n)) = n. %o A261093 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A261093 (define A261093 (LEFTINV-LEASTMONO-NC2NC 0 0 A219640)) %Y A261093 Left inverse of A219640. (A261094 gives the zeroed version). %Y A261093 Partial sums of A261092 summed from its term a(1) onward. %K A261093 nonn %O A261093 0,3 %A A261093 _Antti Karttunen_, Aug 08 2015