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!)
A218705 Number of partitions of n in which any two distinct parts differ by at least 10. 2
1, 1, 2, 2, 3, 2, 4, 2, 4, 3, 4, 2, 7, 4, 8, 9, 13, 11, 18, 16, 23, 22, 27, 27, 36, 35, 41, 42, 51, 48, 61, 57, 69, 65, 80, 81, 98, 93, 115, 112, 144, 136, 170, 164, 202, 204, 244, 242, 296, 290, 353, 350, 415, 412, 493, 494, 576, 580, 671, 673, 794, 786, 903 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Also number of partitions of n in which each part, with the possible exception of the largest, occurs at least 10 times.
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Alois P. Heinz)
FORMULA
G.f.: 1 + Sum_{j>=1} x^j/(1-x^j) * Product_{i=1..j-1} (1+x^(10*i)/(1-x^i)).
log(a(n)) ~ sqrt((2*Pi^2/3 + 4*c)*n), where c = Integral_{0..infinity} log(1 - exp(-x) + exp(-10*x)) dx = -1.2055372531240537414216314471404302128615809819... - Vaclav Kotesovec, Jan 28 2022
EXAMPLE
a(10) = 4: [1,1,1,1,1,1,1,1,1,1], [2,2,2,2,2], [5,5], [10].
a(11) = 2: [1,1,1,1,1,1,1,1,1,1,1], [11].
a(12) = 7: [1,1,1,1,1,1,1,1,1,1,1,1], [2,2,2,2,2,2], [3,3,3,3], [4,4,4], [6,6], [1,11], [12].
MAPLE
b:= proc(n, i) option remember; `if`(n=0, 1, `if`(i<1, 0,
b(n, i-1) +add(b(n-i*j, i-10), j=1..n/i)))
end:
a:= n-> b(n, n):
seq(a(n), n=0..70);
CROSSREFS
Column k=10 of A218698.
Cf. A160980.
Sequence in context: A334080 A066800 A368195 * A193459 A114102 A193513
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Nov 04 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 11:59 EDT 2024. Contains 371254 sequences. (Running on oeis4.)