|
%I #16 Sep 11 2020 13:31:52
%S 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,
%T 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,
%U 10,10,10,9,7,12,6,11,11,11,7,11,12,10,10,11,10,13
%N Minimal number of steps to reach 5*n from 5 using "Choix de Bruxelles" version 2 (cf. A323460).
%C 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
%C The sequence is well defined as we can reach any multiple of 5 starting from 5.
%H Rémy Sigrist, <a href="/A323484/b323484.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Angelini, Lars Blomberg, Charlie Neder, Remy Sigrist, and N. J. A. Sloane, <a href="http://arxiv.org/abs/1902.01444">"Choix de Bruxelles": A New Operation on Positive Integers</a>, arXiv:1902.01444, Feb 2019; Fib. Quart. 57:3 (2019), 195-200.
%H Brady Haran and Neil Sloane, <a href="https://www.youtube.com/watch?v=AeqK96UX3rA">The Brussels Choice</a>, Numberphile video (2020)
%Y Cf. A323286, A323454, A323460, A323464.
%K nonn,base
%O 1,3
%A _Rémy Sigrist_, Jan 16 2019
|
