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.

A369608 Number of solutions to +- 2 +- 3 +- 5 +- 7 +- ... +- prime(2*n) = prime(2*n).

Original entry on oeis.org

0, 2, 2, 6, 14, 39, 125, 399, 1310, 4356, 14970, 51715, 178832, 635778, 2290019, 8106059, 29234378, 105635076, 384409483, 1408730050, 5193316109, 19170300330, 71421970661, 263893092145, 984568438169, 3686368605467, 13838552783467, 52008816746450
Offset: 1

Views

Author

Ilya Gutkovskiy, Jan 27 2024

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Coefficient[Product[(x^Prime[k] + 1/x^Prime[k]), {k, 1, 2 n}], x, Prime[2 n]], {n, 1, 28}]

Formula

a(n) = [x^prime(2*n)] Product_{k=1..2*n} (x^prime(k) + 1/x^prime(k)).