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!)
A218701 Number of partitions of n in which any two distinct parts differ by at least 6. 2
1, 1, 2, 2, 3, 2, 4, 2, 5, 5, 8, 7, 14, 11, 16, 19, 23, 22, 32, 29, 38, 40, 48, 48, 67, 63, 81, 85, 106, 106, 141, 138, 174, 180, 219, 224, 284, 282, 342, 356, 422, 431, 530, 532, 631, 660, 765, 789, 948, 965, 1123, 1184, 1356, 1408, 1658, 1703, 1967, 2076 (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 6 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^(6*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(-6*x)) dx = -1.0551351195231385243969621008395374852115209081... - Vaclav Kotesovec, Jan 28 2022
EXAMPLE
a(6) = 4: [1,1,1,1,1,1], [2,2,2], [3,3], [6].
a(7) = 2: [1,1,1,1,1,1,1], [7].
a(8) = 5: [1,1,1,1,1,1,1,1], [2,2,2,2], [4,4], [1,7], [8].
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-6), j=1..n/i)))
end:
a:= n-> b(n, n):
seq(a(n), n=0..70);
CROSSREFS
Column k=6 of A218698.
Cf. A160976.
Sequence in context: A289435 A328396 A067540 * A305790 A294877 A355830
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 29 01:36 EDT 2024. Contains 371264 sequences. (Running on oeis4.)