login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323484 Minimal number of steps to reach 5*n from 5 using "Choix de Bruxelles" version 2 (cf. A323460). 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

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.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..10000

Eric Angelini, Lars Blomberg, Charlie Neder, Remy Sigrist, and N. J. A. Sloane, "Choix de Bruxelles": A New Operation on Positive Integers, arXiv:1902.01444, Feb 2019

CROSSREFS

Cf. A323286, A323454, A323460, A323464.

Sequence in context: A066795 A079366 A226110 * A330521 A318927 A267320

Adjacent sequences:  A323481 A323482 A323483 * A323485 A323486 A323487

KEYWORD

nonn,base

AUTHOR

Rémy Sigrist, Jan 16 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 30 21:19 EDT 2020. Contains 333132 sequences. (Running on oeis4.)