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 A255338 #6 Feb 21 2015 15:38:19 %S A255338 0,1,2,3,4,4,5,6,7,7,8,8,9,9,10,11,12,13,13,14,14,14,15,15,16,16,17, %T A255338 17,18,18,19,20,21,22,22,23,23,23,24,24,25,25,25,26,26,26,27,27,28,29, %U A255338 29,30,30,30,31,31,32,32,33,33,34,34,35,36,37,38,38,39,39,39,40,40,41,41,41,42,42 %N A255338 Each n occurs A255337(n) times. %H A255338 Antti Karttunen, <a href="/A255338/b255338.txt">Table of n, a(n) for n = 0..8192</a> %F A255338 a(n) = The least k such that A255057(k) >= n. %o A255338 (Scheme, with _Antti Karttunen_'s IntSeq-library) %o A255338 (define A255338 (LEAST-GTE-I 0 0 A255057)) %Y A255338 The first differences gives A255339, the characteristic function of A255057. %Y A255338 Cf. A255337. %K A255338 nonn %O A255338 0,3 %A A255338 _Antti Karttunen_, Feb 21 2015