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.

A160812 a(n) = A161205(n)-A000005(n).

Original entry on oeis.org

0, 0, 0, 0, 2, 0, 2, 0, 2, 2, 4, 0, 4, 2, 2, 2, 6, 2, 6, 2, 4, 4, 6, 0, 6, 6, 6, 4, 8, 2, 8, 4, 6, 6, 6, 2, 10, 8, 8, 4, 10, 4, 10, 6, 6, 8, 10, 2, 10, 8, 10, 8, 12, 6, 10, 6, 10, 10, 12, 2, 12, 10, 8, 8, 12, 8, 14, 10, 12, 8, 14, 4, 14, 12, 10, 10, 12, 8, 14, 6, 12, 14, 16, 6, 14, 14, 14, 10, 16, 6
Offset: 1

Views

Author

Omar E. Pol, Jun 19 2009

Keywords

Comments

It appears that a(n)= 0 if and only if n divides 24 (See also the comments in A018253).

Crossrefs

Formula

a(n) = 2*(A000196(n) - A038548(n)) = 2*A236627(n). - Omar E. Pol, Feb 05 2014

Extensions

Edited by Omar E. Pol, Aug 02 2009