The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293467 a(n) = Sum_{k=0..n} (-1)^k * binomial(n, k) * q(k), where q(k) is A000009 (partitions into distinct parts). 11
 1, 0, 0, -1, -3, -7, -14, -25, -41, -64, -100, -165, -294, -550, -1023, -1795, -2823, -3658, -2882, 2873, 20435, 62185, 148863, 314008, 613957, 1155794, 2175823, 4244026, 8753538, 19006490, 42471787, 95234575, 210395407, 453413866, 949508390, 1931939460 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Vaclav Kotesovec, Table of n, a(n) for n = 0..1000 Vaclav Kotesovec, Graph: a(n)/2^n (40000 terms) MATHEMATICA Table[Sum[(-1)^k * Binomial[n, k] * PartitionsQ[k], {k, 0, n}], {n, 0, 50}] CROSSREFS Cf. A025147, A266232, A294467, A294468. Cf. A218481, A294466, A281425, A095051. Sequence in context: A004006 A089240 A057524 * A011795 A051170 A265252 Adjacent sequences:  A293464 A293465 A293466 * A293468 A293469 A293470 KEYWORD sign AUTHOR Vaclav Kotesovec, Oct 09 2017 STATUS approved

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.

Last modified April 18 05:44 EDT 2021. Contains 343072 sequences. (Running on oeis4.)