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.

A262678 a(n) = n - A262690(n), where A262690(n) = largest square k <= n such that A002828(n-k) = A002828(n)-1.

Original entry on oeis.org

0, 0, 1, 2, 0, 1, 2, 3, 4, 0, 1, 2, 8, 4, 5, 6, 0, 1, 9, 10, 4, 5, 13, 14, 8, 0, 1, 2, 3, 4, 5, 6, 16, 8, 9, 10, 0, 1, 2, 3, 4, 16, 17, 18, 8, 9, 10, 11, 32, 0, 1, 2, 16, 4, 5, 6, 20, 8, 9, 10, 11, 25, 13, 14, 0, 1, 2, 18, 4, 5, 34, 22, 36, 9, 25, 26, 40, 13, 29, 30, 16, 0, 1, 2, 20, 4, 5, 6, 52, 25, 9, 10, 11, 29, 13, 14, 32, 16, 49, 18, 0
Offset: 0

Views

Author

Antti Karttunen, Oct 03 2015

Keywords

Crossrefs

Cf. also A053186.

Programs

Formula

a(n) = n - A262690(n).