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 A263270 #7 Nov 27 2015 00:19:27 %S A263270 0,1,1,2,2,2,3,3,3,3,3,4,4,4,4,5,5,5,5,5,6,6,6,6,6,6,7,7,7,7,8,8,8,8, %T A263270 9,9,9,9,10,10,10,10,10,10,10,10,11,11,11,11,12,12,12,12,13,13,13,13, %U A263270 13,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,16,16,16,16,16,16,16,17,17,17,17,17,17,17,18 %N A263270 Each n occurs A262507(n) times. %H A263270 Antti Karttunen, <a href="/A263270/b263270.txt">Table of n, a(n) for n = 0..12917</a> %F A263270 Other identities. For all n >= 0: %F A263270 a(n) = A155043(A263265(n)). %F A263270 a(A263260(n)) = n+1. [The sequence is one more than the least monotonic left inverse of A263260.] %o A263270 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A263270 (define A263270 (COMPOSE 1+ (LEFTINV-LEASTMONO 0 0 A263260))) %Y A263270 Cf. A155043, A262507, A263260, A263265, A263266. %K A263270 nonn %O A263270 0,4 %A A263270 _Antti Karttunen_, Nov 24 2015