login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A239664 a(n) = 1, a(n+1) = smallest number not occurring earlier, having with a(n) neither a common digit nor a common divisor. 2
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 23, 11, 20, 13, 22, 15, 26, 17, 24, 19, 25, 14, 27, 16, 29, 18, 35, 12, 37, 21, 34, 55, 28, 31, 40, 33, 41, 30, 47, 32, 45, 38, 49, 36, 59, 42, 53, 44, 39, 46, 51, 43, 50, 61, 48, 65, 71, 52, 63, 58, 67, 54, 73, 56, 79, 60, 77 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

PROG

(Haskell)

import Data.List (delete, intersect); import Data.Function (on)

a239664 n = a239664_list !! (n-1)

a239664_list = 1 : f 1 [2..] where

   f v ws = g ws where

     g (x:xs) = if gcd v x == 1 && ((intersect `on` show) v x == "")

                   then x : f x (delete x ws) else g xs

(PARI) {u=[]; a=1; for(n=1, 99, print1(a", "); u=setunion(u, [a]); while(#u>1&&u[2]==u[1]+1, u=u[^1]); for(k=u[1]+1, 9e9, setsearch(u, k)&&next; gcd(k, a)>1&&next; #setintersect(Set(digits(a)), Set(digits(k)))&&next; a=k; next(2))); a} \\ M. F. Hasler, Sep 17 2016

CROSSREFS

Cf. A054659, A067581, A276633, A276512.

Sequence in context: A308540 A179310 A114806 * A276766 A039229 A054659

Adjacent sequences:  A239661 A239662 A239663 * A239665 A239666 A239667

KEYWORD

nonn,base

AUTHOR

Reinhard Zumkeller, Mar 23 2014

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 October 16 20:55 EDT 2019. Contains 328103 sequences. (Running on oeis4.)