login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014648 Number of partitions of n into its divisors with at least one part of size 1. 4

%I

%S 1,1,1,2,1,5,1,6,3,8,1,33,1,11,11,26,1,66,1,76,15,17,1,378,5,20,18,

%T 136,1,648,1,166,23,26,23,1954,1,29,27,1212,1,1500,1,309,261,35,1,

%U 8600,7,378,35,422,1,2877,35,2803,39,44,1,66129,1,47,461,1626,41,4936

%N Number of partitions of n into its divisors with at least one part of size 1.

%H Alois P. Heinz, <a href="/A014648/b014648.txt">Table of n, a(n) for n = 1..10000</a>

%F Coefficient of x^(n-1) in expansion of 1/Product_{d divides n} (1-x^d). - _Vladeta Jovovic_, Apr 11 2004

%p with(numtheory):

%p a:= proc(n) option remember; local b, l; l:= sort([divisors(n)[]]):

%p b:= proc(m, i) option remember; `if`(m=0, 1, `if`(i<1, 0,

%p b(m, i-1)+`if`(l[i]>m, 0, b(m-l[i], i))))

%p end; forget(b):

%p b(n-1, nops(l))

%p end:

%p seq(a(n), n=1..100); # _Alois P. Heinz_, Feb 05 2014

%t a[n_] := a[n] = Module[{b, l}, l = Divisors[n]; b[m_, i_] := b[m, i] = If[m==0, 1, If[i<1, 0, b[m, i-1] + If[l[[i]]>m, 0, b[m-l[[i]], i]]]]; b[n-1, Length[l]]]; Table[a[n], {n, 1, 100}] (* _Jean-François Alcover_, Apr 07 2015, after _Alois P. Heinz_ *)

%Y Cf. A018818.

%K nonn

%O 1,4

%A _Olivier Gérard_

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 November 27 12:51 EST 2021. Contains 349394 sequences. (Running on oeis4.)