|
%I #10 Aug 10 2014 11:14:27
%S 1,11,21,12,31,13,41,14,51,15,61,16,71,17,81,18,91,19,101,111,121,131,
%T 141,151,161,171,181,191,201,22,32,23,42,24,52,25,62,26,72,27,82,28,
%U 92,29,102,211,112,221,122,231,132,241,142,251,152,261,162,271,172,281,182
%N a(1) = 1, a(n) = smallest positive number b not among a(1)..a(n-1) such that the last digit of b = the first digit of a(n-1).
%C A dyslexic person might have trouble distinguishing this sequence from A125887!
%C A010879(a(n+1)) = A000030(a(n)). - _Reinhard Zumkeller_, Aug 10 2014
%H Reinhard Zumkeller, <a href="/A125886/b125886.txt">Table of n, a(n) for n = 1..10000</a>
%H Hans Havermann, <a href="/A125886/a125886.png">Graph of first 10000 terms</a>
%t s={1}; fi=1; Do[Do[id=IntegerDigits[i]; la=id[[ -1]]; If[fi==la&&FreeQ[s,i],AppendTo[s,i]; fi=id[[1]]; Break[]],{i,11,10^5}],{999}]; s
%o (Haskell)
%o import Data.List (delete)
%o a125886 n = a125886_list !! (n-1)
%o a125886_list = 1 : f 1 [10..] where
%o f u vs = g vs where
%o g (w:ws) = if a010879 w == iu then w : f w (delete w vs) else g ws
%o iu = a000030 u
%o -- _Reinhard Zumkeller_, Aug 10 2014
%Y Cf. A125887.
%Y Cf. A000030, A010879.
%K base,nonn,look,hear
%O 1,2
%A _Zak Seidov_, Dec 13 2006
|
