%I
%S 1,5,2,3,4,6,7,50,8,51,10,52,9,11,500,12,13,53,14,20,16,54,17,18,19,
%T 21,30,22,23,24,26,27,28,29,40,31,32,33,34,36,37,38,39,41,42,43,151,
%U 44,46,47,152,48,49,61,62,63,64,66,67,68,69,71,72,73,74,76,77,78,79,81,82,83,84,86,87,88,56,89,91,92,93,153
%N Lexicographically earliest sequence of distinct positive numbers such that (i) the numbers of terms separating successive multiples of 5 gives the sequence itself, and (ii) the numbers of digits separating successive occurrences of the digit 5 also gives the sequence.
%C The title of the web page is meant to suggest that this "suite" is "sweet", as indeed it is.  _N. J. A. Sloane_, Jan 01 2014
%H Lars Blomberg, <a href="/A234593/b234593.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/PaquetsAchromes.htm">La suite F</a>
%H E. Angelini, <a href="/A234593/a234593.pdf">La suite F</a> [Cached copy, with permission]
%e Here is the sequence with the multiples of 5 set off by asterisks:
%e 1, *5*, 2, 3, 4, 6, 7, *50*, 8, 51, *10*, 52, 9, 11, *500*, 12, 13, 53, 14, *20*, 16, 54, 17, 18, 19, 21, *30*, 22, 23, ...
%e The numbers of terms between the multiples of 5 is 1, 5, 2, 3, 4, ..., which gives the sequence.
%e Here is the sequence with the 5's digits set off by asterisks:
%e 1, *5*, 2, 3, 4, 6, 7, *5*0, 8, *5*1, 10, *5*2, 9, 11, *5*00, 12, 13, *5*3, 14, 20, 16, *5*4, 17, 18, 19, 21, 30, 22, 23, 24, 26, 27, 28, 29, 40, 31, 32, 33, 34, 36, 37, 38, 39, 41, 42, 43, 1*5*1, 44, ...
%e The numbers of digits between the 5's is again the sequence.
%K nonn,base
%O 1,2
%A _Eric Angelini_, Jan 01 2014
