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.

A280492 a(1) = 0; for n > 1, a(n) = A246277(n) - A078898(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 7, 0, 0, 0, 0, 0, -1, 0, 2, 0, 0, 0, 7, 0, 0, 0, 0, 0, -4, 0, 0, 0, 0, 0, -6, 0, 0, 0, 5, 0, 8, 0, 0, 0, 1, 0, 13, 0, 6, 0, 0, 0, -3, 0, 0, 0, 0, 0, -3, 0, 0, 0, 0, 0, 12, 0, 0, 0, 9, 0, 2, 0, 2
Offset: 1

Views

Author

Antti Karttunen, Jan 09 2017

Keywords

Comments

For n > 1, a(n) gives the difference of column positions of n's location in arrays A246278 and A083221. Note that any n occurs on the same row in both arrays.

Crossrefs

Programs

Formula

a(1) = 0; for n > 1, a(n) = A246277(n) - A078898(n).