|
|
A195054
|
|
a(n) = p(n) - p(n-1) - p(n-2) + p(n-5), where p(n) = A000041(n).
|
|
1
|
|
|
1, 0, 0, 0, 0, 0, 0, -1, -1, -2, -3, -5, -6, -10, -13, -18, -24, -33, -42, -57, -72, -94, -120, -154, -192, -245, -305, -382, -473, -588, -721, -891, -1087, -1330, -1617, -1966, -2374, -2874, -3456, -4157, -4979, -5963, -7110, -8481, -10075, -11964, -14168
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,10
|
|
COMMENTS
|
In the introduction of the Andrews-Merca paper appears the inequality: p(n) - p(n-1) - p(n-2) + p(n-5) <= 0, for n > 0. Consider here that the partition number of a negative integer is equal to zero.
The absolute value of a(n) counts the partitions of n in which 2 is the least integer that is not a part and there are more parts >2 than there are 1. [Mircea Merca, Jul 13 2013]
|
|
REFERENCES
|
M. Merca, Fast algorithm for generating ascending compositions, J. Math. Model. Algorithms 11 (2012), 89-104.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (1 - x - x^2 + x^5) / Product_{k>=1} (1-x^k). - Vaclav Kotesovec, Nov 05 2015
a(n) ~ -Pi * exp(Pi*sqrt(2*n/3)) / (6 * sqrt(2) * n^(3/2)). - Vaclav Kotesovec, Nov 05 2015
|
|
MAPLE
|
p:= n-> `if`(n<0, 0, combinat[numbpart](n)):
a:= n-> p(n) -p(n-1) -p(n-2) +p(n-5):
|
|
MATHEMATICA
|
p = PartitionsP; a[n_] := p[n] - p[n-1] - p[n-2] + p[n-5]; Table[a[n], {n, 0, 50}] (* Jean-François Alcover, Nov 05 2015 *)
nmax = 50; CoefficientList[Series[(1 - x - x^2 + x^5)/Product[1-x^k, {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Nov 05 2015 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|