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.

Showing 1-1 of 1 results.

A323484 Minimal number of steps to reach 5*n from 5 using "Choix de Bruxelles" version 2 (cf. A323460).

Original entry on oeis.org

0, 1, 11, 2, 11, 12, 8, 3, 10, 12, 9, 11, 7, 9, 10, 4, 9, 10, 10, 13, 10, 10, 7, 10, 8, 6, 9, 9, 9, 9, 8, 5, 10, 8, 11, 9, 10, 9, 11, 14, 11, 11, 8, 10, 8, 7, 10, 9, 9, 9, 9, 6, 9, 9, 11, 8, 9, 10, 10, 10, 9, 7, 12, 6, 11, 11, 11, 7, 11, 12, 10, 10, 11, 10, 13
Offset: 1

Views

Author

Rémy Sigrist, Jan 16 2019

Keywords

Comments

This is equally the minimal number of steps to reach 5*n from 5 using "Choix de Bruxelles" version 1 (cf. A323286). - N. J. A. Sloane, Jan 24 2019
The sequence is well defined as we can reach any multiple of 5 starting from 5.

Crossrefs

Showing 1-1 of 1 results.