|
%I #8 Dec 02 2016 09:54:43
%S 0,1,2,20,21,3,23,4,5,24,6,7,8,25,9,10,12,11,13,14,26,15,16,17,27,18,
%T 19,30,32,31,33,34,35,42,36,37,38,39,40,28,41,43,44,45,46,29,47,48,49,
%U 50,51,52,53,54,55,56,57,58,62,59,60,61,63,64,65,66,200,67,68,69,70,71,73,72,74,75,76,77,78,79,80,81,201,83,84,85,86,87,88,89,82,90,91,93,94,95,96,97,98,99,203,100,101,103,104,105,102,106,107,108,109
%N Between two successive digits "2" 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="/A278938/b278938.txt">Table of n, a(n) for n = 1..1054</a>
%e There are 0 digit between "2" and "20"; there is 1 digit between the “2” of "20" and the "2" of "21" (this is the "0" of "20"); there are 2 digits between the "2" of "21" and the "2" of "23" (they are the "1" of "21" and the "3" of "3"); there are 3 digits between the "2" of "23" and the "2" of "24" (they are the "3" of "23", the "4" of "4" and the "5" of "5"); etc.
%K nonn,base
%O 1,3
%A _Eric Angelini_ and _Jean-Marc Falcoz_, Dec 02 2016
|
