cp's OEIS Frontend

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

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