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.

A331293 Let h = A061395(n) and u = A108951(n) - (A002110(h)*A329348(n)). Then a(n) = u/A002110(1+h).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 1, 4, 0, 7, 0, 0, 1, 0, 5, 0, 0, 2, 4, 0, 0, 0, 1, 0, 1, 0, 0, 5, 0, 0, 3, 19, 8, 0, 0, 0, 14, 2, 0, 0, 0, 0, 3, 0, 0, 3, 10, 1, 0, 0, 0, 0, 5, 0, 9, 0, 0, 25, 0, 16, 0, 0, 2, 43, 0, 0, 2, 1, 0, 0, 0, 0, 10, 12, 0, 0, 0, 1, 6, 0, 38, 2, 17, 0, 0, 0, 0, 16
Offset: 1

Views

Author

Antti Karttunen, Jan 17 2020

Keywords

Crossrefs

Cf. A331294 (positions of records).

Programs

Formula

a(n) modulo A151800(A117366(n)) = A331292(n).