cp's OEIS Frontend

A216601 Number of ways to write n as a product with all factors <= n/5.

%I A216601 #6 Jul 13 2013 12:04:31
%S A216601 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,2,1,0,1,0,0,2,0,3,0,0,
%T A216601 1,4,0,0,0,3,0,2,0,0,2,0,0,7,1,2,0,0,0,4,1,3,0,0,0,6,0,0,2,7,1,2,0,0,
%U A216601 0,3,0,11,0,0,2,0,1,2,0,8,3,0,0,6,1,0
%N A216601 Number of ways to write n as a product with all factors <= n/5.
%C A216601 a(n) = A066032(n,floor(n/5)) for n > 4.
%H A216601 Reinhard Zumkeller, <a href="/A216601/b216601.txt">Table of n, a(n) for n = 1..1000</a>
%e A216601 a(50) = #{10*2, 5*5*2} = 2;
%e A216601 a(51) = #{} = 0;
%e A216601 a(52) = #{} = 0;
%e A216601 a(53) = #{} = 0;
%e A216601 a(54) = #{9*6, 9*3*2, 6*3*3, 3*3*3*2} = 4;
%e A216601 a(55) = #{11*5} = 1.
%o A216601 (Haskell)
%o A216601 a216601 n | n <= 4    = 0
%o A216601           | otherwise = a066032_tabl !! (n-1) !! (n `div` 5 - 1)
%Y A216601 Cf. A001055, A028422, A216599, A216600, A216602.
%K A216601 nonn
%O A216601 1,24
%A A216601 _Reinhard Zumkeller_, Oct 01 2012