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