A216599 - OEIS

A216599

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

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, 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, 1, 3, 0, 14, 0, 0, 3, 2, 1, 3, 0, 10, 4, 0, 0, 9, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,12

COMMENTS

a(n) = A066032(n,floor(n/3)) for n > 2.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

EXAMPLE

a(30) = #{10*3, 6*5, 5*3*2} = 3;

a(31) = #{} = 0;

a(32) = #{8*4, 8*2*2, 4*4*2, 4*2*2*2, 2*2*2*2*2} = 5;

a(33) = #{11*3} = 1;