cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A293465 a(n) = Sum_{k=0..n} (-1)^k * 2^k * q(k), where q(k) is A000009 (partitions into distinct parts).

Original entry on oeis.org

1, -1, 3, -13, 19, -77, 179, -461, 1075, -3021, 7219, -17357, 44083, -103373, 257075, -627661, 1469491, -3511245, 8547379, -19764173, 47344691, -112038861, 261254195, -611161037, 1435659315, -3329070029, 7743892531, -18025911245, 41566759987, -95872193485
Offset: 0

Views

Author

Vaclav Kotesovec, Oct 09 2017

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Sum[(-1)^k * 2^k * PartitionsQ[k], {k, 0, n}], {n, 0, 30}]

Formula

a(n) ~ (-1)^n * 2^(n-1) * exp(Pi*sqrt(n/3)) / (3^(5/4) * n^(3/4)).
a(n) ~ (-1)^n * 2/3 * 2^n * A000009(n).
Showing 1-1 of 1 results.