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.

A372352 The difference between n and the largest term of A086893 <= n.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 0, 1, 2, 3, 4, 5, 6
Offset: 1

Views

Author

Antti Karttunen (proposed by Ali Sada), Apr 29 2024

Keywords

Comments

The terms a(n) grow from 0 (whenever n is in A086893) by 1 until the next element of A086893 is reached. - M. F. Hasler, May 08 2025

Crossrefs

Cf. also A372286.

Programs

Formula

a(n) = n - max ( A086893 intersect [1..n] ) (= 0 iff n in A086893). - M. F. Hasler, May 08 2025