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.

A194186 a(n) = A193507(n) - A080359(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 18, 12, 0, 0, 0, 0, 36, 34, 0, 0, 0, 0, 0, 0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 36, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 0, 0, 0, 0, 16, 0, 0, 0, 12, 0, 0, 0, 0, 0
Offset: 1

Views

Author

Vladimir Shevelev, Aug 18 2011

Keywords

Comments

Conjecture: The sequence is unbounded.
Records are 0, 18, 36, 48, 52, ... with indices 1, 14, 20, 44, 96, ...
The places of nonzero terms correspond to places of those terms of A193507 which are in A164294. Conjecture: The asymptotic density of nonzero terms is 2/(e^2+1). A heuristic proof follows from the comment to A193507 and the first reference there.

Crossrefs