cp's OEIS Frontend

A076654 Smallest natural number not a multiple of 10, not occurring earlier and starting with the end of the previous term.

%I A076654 #18 Aug 22 2024 03:18:02
%S A076654 1,11,12,2,21,13,3,31,14,4,41,15,5,51,16,6,61,17,7,71,18,8,81,19,9,91,
%T A076654 101,102,22,23,32,24,42,25,52,26,62,27,72,28,82,29,92,201,103,33,34,
%U A076654 43,35,53,36,63,37,73,38,83,39,93,301,104,44,45,54,46,64,47,74,48,84,49,94
%N A076654 Smallest natural number not a multiple of 10, not occurring earlier and starting with the end of the previous term.
%H A076654 Reinhard Zumkeller, <a href="/A076654/b076654.txt">Table of n, a(n) for n = 1..8936</a>, all terms < 10000
%F A076654 A000030(a(n+1)) = A010879(a(n)). - _Reinhard Zumkeller_, Aug 15 2015
%p A076654 startsWith := proc(n,dig) local nshft ; nshft := n ; while nshft >= 10 do nshft := floor(nshft/10) ; od ; if dig = nshft then RETURN(true) ; else RETURN(false) ; fi ; end: A076654 := proc(nmax) local candid,a; a := [1] ; while nops(a) < nmax do candid := 2 ; while not startsWith(candid,op(-1,a) mod 10) or candid mod 10 = 0 or candid in a do candid := candid+1 ; od ; a := [op(a),candid] ; od ; RETURN(a) ; end: a := A076654(200) : for n from 1 to nops(a) do printf("%d,",op(n,a)) ; od ; # _R. J. Mathar_, Nov 12 2006
%o A076654 (Haskell)
%o A076654 import Data.List (delete)
%o A076654 a076654 n = a076654_list !! (n-1)
%o A076654 a076654_list = f a067251_list 1 where
%o A076654   f xs z = g xs where
%o A076654     g (y:ys) = if a000030 y == mod z 10 then y : f (delete y xs) y else g ys
%o A076654 -- _Reinhard Zumkeller_, Aug 15 2015
%Y A076654 Cf. A076652, A076653.
%Y A076654 Cf. A000030, A010879, A067251.
%K A076654 base,nonn
%O A076654 1,2
%A A076654 _Amarnath Murthy_, Oct 28 2002
%E A076654 More terms from _R. J. Mathar_, Nov 12 2006