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 A258198 #11 Jun 05 2015 03:54:49 %S A258198 0,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, %T A258198 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3, %U A258198 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4 %N A258198 a(n) = largest k for which A001563(k) = k*k! <= n. %C A258198 Number of nonzero terms of A001563 <= n. %C A258198 Each n occurs A001564(n) times. %H A258198 Antti Karttunen, <a href="/A258198/b258198.txt">Table of n, a(n) for n = 0..4320</a> %o A258198 (Scheme) (define (A258198 n) (let loop ((k 1) (f 1)) (if (> (* k f) n) (- k 1) (loop (+ k 1) (* (+ k 1) f))))) %Y A258198 Cf. A001563, A001564, A084556, A084557, A256450, A258199. %K A258198 nonn %O A258198 0,5 %A A258198 _Antti Karttunen_, May 23 2015