login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A216602 Number of ways to write n as a product with all factors <= n/6. 7
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, 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, 0, 2, 0, 11, 0, 0, 1, 0, 1, 2, 0, 7, 3, 0, 0, 6, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,24

COMMENTS

a(n) = A066032(n,floor(n/6)) for n > 5.

LINKS

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

EXAMPLE

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

a(61) = #{} = 0;

a(62) = #{} = 0;

a(63) = #{9*7, 7*3*3} = 2;

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;

a(65) = #{} = 0.

PROG

(Haskell)

a216602 n | n <= 5    = 0

          | otherwise = a066032_tabl !! (n-1) !! (n `div` 6 - 1)

CROSSREFS

Cf. A001055, A028422, A216599, A216600, A216601.

Sequence in context: A228101 A078128 A191269 * A236233 A112607 A161371

Adjacent sequences:  A216599 A216600 A216601 * A216603 A216604 A216605

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Oct 01 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 24 11:46 EDT 2019. Contains 321448 sequences. (Running on oeis4.)