login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100346 Number of compositions of n into divisors of n. 24

%I #18 Nov 08 2023 10:32:20

%S 1,1,2,2,6,2,25,2,56,20,129,2,1628,2,742,450,5272,2,45316,2,83344,

%T 3321,29967,2,5105722,572,200390,26426,5469759,2,154004511,2,47350056,

%U 226020,9262157,51886,15140335650,2,63346598,2044895,14700095926,2,185493291001,2

%N Number of compositions of n into divisors of n.

%H Alois P. Heinz, <a href="/A100346/b100346.txt">Table of n, a(n) for n = 0..2000</a>

%F Coefficient of x^n in expansion of 1/(1-Sum_{d divides n} x^d ).

%p with(numtheory): G:=proc(n) local DV: DV:=divisors(n): 1/(1-sum(x^DV[j], j=1..tau(n))) end: seq(coeff(series(G(n), x, 80), x, n), n=0..44); # _Emeric Deutsch_, Feb 16 2005

%p # second Maple program:

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

%p l, b:= numtheory[divisors](n),

%p proc(m) option remember; `if`(m=0, 1,

%p add(`if`(j>m, 0, b(m-j)), j=l))

%p end; b(n)

%p end:

%p seq(a(n), n=0..50); # _Alois P. Heinz_, Mar 28 2017

%t a[n_] := SeriesCoefficient[1/(1-DivisorSum[n, x^#&]), {x, 0, n}]; Array[a, 50] (* _Jean-François Alcover_, Apr 06 2017 *)

%Y Cf. A018818.

%K easy,nonn

%O 0,3

%A _Vladeta Jovovic_, Dec 29 2004

%E More terms from _Emeric Deutsch_, Feb 16 2005

%E a(0)=1 prepended by _Alois P. Heinz_, Nov 08 2023

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)