|
%I #10 Dec 06 2016 22:32:01
%S 0,1,2,3,4,5,6,60,61,7,62,8,9,63,10,16,11,12,26,13,14,15,64,17,18,19,
%T 65,20,21,22,36,23,24,25,27,46,28,29,30,31,32,67,33,34,35,37,38,68,39,
%U 40,41,42,43,56,44,45,47,48,49,50,76,51,52,53,54,55,57,58,69,59,70,71,72,73,74
%N Between two successive digits "6" there are 0, then 1, then 2, then 3, ... other digits.
%C The sequence starts with a(1) = 0 and is always extended with the smallest integer not yet present that does not lead to a contradiction.
%H Jean-Marc Falcoz, <a href="/A278941/b278941.txt">Table of n, a(n) for n = 1..1058</a>
%e There are 0 digit between "6" and "60"; there is 1 digit between the "6" of "60" and the "6" of "61" (this is the "0" of "60"); there are 2 digits between the "6" of "61" and the "6" of "62" (they are the "1" of "61" and the "7" of "7"); there are 3 digits between the "6" of "62" and the "6" of "63" (they are the "2" of "62", the "8" of "8" and the "9" of "9"); etc.
%K nonn,base
%O 1,3
%A _Eric Angelini_ and _Jean-Marc Falcoz_, Dec 02 2016
|
