OFFSET
1,4
COMMENTS
The number of partitions of n that have the first part at least thrice larger than the second part. Example: a(8) = #{8, 7+1, 6+2, 6+1+1, 5+1+1+1, 4+1+1+1+1, 3+1+1+1+1+1}=7. [Mircea Merca, Jul 24 2011]
LINKS
Vaclav Kotesovec, Table of n, a(n) for n = 1..10000
Mircea Merca, Fast algorithm for generating ascending compositions, arXiv:1903.10797 [math.CO], 2019.
FORMULA
a(n) = p(n) - p(n-2) - p(n-3) + p(n-5) where p(n) = A000041(n). See Merca p. 6. - Michel Marcus, Mar 27 2019
a(n) ~ exp(Pi*sqrt(2*n/3)) * Pi^2 / (4*sqrt(3)*n^2) * (1 - (18/Pi + 61*Pi/24)/sqrt(6*n)). - Vaclav Kotesovec, Jan 15 2022
EXAMPLE
a(8) = #{8,7+1,6+2,5+3,4+4,4+3+1,3+3+2} = 7;
a(9) = #{9,8+1,7+2,6+3,5+4,5+3+1,4+4+1,4+3+2,3+3+3} = 9.
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Aug 14 2006
STATUS
approved