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.

User: Payton Richards

Payton Richards's wiki page.

Payton Richards has authored 1 sequences.

A376931 Number of points out of n points placed on a circle that can never be reached when starting at one point and then moving clockwise in incrementally increasing steps (first 1, then 2, 3, 4, ...).

Original entry on oeis.org

0, 0, 1, 0, 2, 2, 3, 0, 5, 4, 5, 4, 6, 6, 9, 0, 8, 10, 9, 8, 13, 10, 11, 8, 14, 12, 16, 12, 14, 18, 15, 0, 21, 16, 23, 20, 18, 18, 25, 16, 20, 26, 21, 20, 33, 22, 23, 16, 27, 28, 33, 24, 26, 32, 37, 24, 37, 28, 29, 36, 30, 30, 47, 0, 44, 42, 33, 32, 45, 46, 35
Offset: 1

Views

Author

Payton Richards, Oct 11 2024

Keywords

Comments

Put n distinct points on the edge of a circle. Connect the first to the point 1 step clockwise from it, then connect that one to the point 2 steps clockwise from that, continuing with 3 steps, 4 steps, etc. In the end, a(n) is the number of points never landed on.

Crossrefs

Cf. A117484.

Formula

a(n) = n - A117484(n).

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.