Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Jun 05 2015 03:54:49
%S 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 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 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 a(n) = largest k for which A001563(k) = k*k! <= n.
%C Number of nonzero terms of A001563 <= n.
%C Each n occurs A001564(n) times.
%H Antti Karttunen, <a href="/A258198/b258198.txt">Table of n, a(n) for n = 0..4320</a>
%o (Scheme) (define (A258198 n) (let loop ((k 1) (f 1)) (if (> (* k f) n) (- k 1) (loop (+ k 1) (* (+ k 1) f)))))
%Y Cf. A001563, A001564, A084556, A084557, A256450, A258199.
%K nonn
%O 0,5
%A _Antti Karttunen_, May 23 2015