|
%I #21 Sep 30 2020 14:57:11
%S 1,10,12,21,23,32,34,43,45,54,46,9,2,20,13,31,24,42,35,53,47,8,3,19,
%T 14,30,25,41,36,52,48,7,4,18,15,29,26,40,37,51,49,6,5,17,16,28,27,39,
%U 38,50,60,55,11,22,33,44,56,57,58,59,63,70,74,81,85,92,96,103,97,69,64
%N Lexicographically earliest sequence of distinct positive integers such that a(n) + a(n+1) has at least one pair of identical adjacent digits.
%H Carole Dubois, <a href="/A337866/b337866.txt">Table of n, a(n) for n = 1..5001</a>
%e a(1) + a(2) = 1 + 10 = 11 (a pair of 1's);
%e a(2) + a(3) = 10 + 12 = 22 (a pair of 2's);
%e a(3) + a(4) = 12 + 21 = 33 (a pair of 3's);
%e ...
%e a(10) + a(11) = 54 + 46 = 100 (a pair of 0's); etc.
%Y Cf. A043096 (numbers in which every pair of adjacent digits are distinct).
%K nonn,base
%O 1,2
%A _Eric Angelini_ and _Carole Dubois_, Sep 27 2020
|
