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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245041 Number of partitions of n where the minimal multiplicity of any part is 10. 2

%I

%S 1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,1,2,1,2,1,2,1,2,1,4,2,3,3,

%T 3,2,4,2,3,3,6,3,6,4,6,4,6,3,7,4,9,6,11,7,13,11,14,12,17,13,25,18,24,

%U 22,30,26,35,28,37,33,49,37,53,45,56,54,67,58

%N Number of partitions of n where the minimal multiplicity of any part is 10.

%H Joerg Arndt and Alois P. Heinz, <a href="/A245041/b245041.txt">Table of n, a(n) for n = 10..1000</a>

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

%p b(n, i-1, k) +add(b(n-i*j, i-1, k), j=max(1, k)..n/i)))

%p end:

%p a:= n-> b(n$2, 10) -b(n$2, 11):

%p seq(a(n), n=10..100);

%t b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, b[n, i - 1, k] + Sum[b[n - i*j, i - 1, k], {j, Max[1, k], n/i}]]];

%t a[n_] := b[n, n, 10] - b[n, n, 11];

%t Table[a[n], {n, 10, 100}] (* _Jean-Fran├žois Alcover_, May 01 2018, translated from Maple *)

%Y Column k=10 of A243978.

%K nonn

%O 10,21

%A _Joerg Arndt_ and _Alois P. Heinz_, Jul 10 2014

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 October 13 20:38 EDT 2019. Contains 327981 sequences. (Running on oeis4.)