login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A229364 a(1) = 1; for n > 1: a(n) = smallest odd number greater than a(n-1) which does not use any digit used by a(n-1). 4
1, 3, 5, 7, 9, 11, 23, 41, 53, 61, 73, 81, 93, 101, 223, 401, 523, 601, 723, 801, 923, 1001, 2223, 4001, 5223, 6001, 7223, 8001, 9223, 10001, 22223, 40001, 52223, 60001, 72223, 80001, 92223, 100001, 222223, 400001, 522223, 600001, 722223, 800001, 922223 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..45.

PROG

(Haskell)

import Data.List (intersect)

a229364 n = a229364_list !! (n-1)

a229364_list = f "" [1, 3 ..] where

   f xs (o:os) = if null $ intersect xs ys then o : f ys os else f xs os

                 where ys = show o

CROSSREFS

Cf. A030284, A030283, A229363, A005408.

Sequence in context: A178995 A071240 A088049 * A029660 A264734 A004156

Adjacent sequences:  A229361 A229362 A229363 * A229365 A229366 A229367

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Sep 21 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 24 04:35 EST 2020. Contains 331183 sequences. (Running on oeis4.)