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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129562 Slowest increasing sequence that starts with 1 and has property that adding two consecutive terms gives a number which does not share a digit with either of the two terms. 1
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 17, 18, 19, 21, 22, 23, 25, 35, 36, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 51, 149, 151, 152, 154, 155, 165, 167, 168, 169, 171, 172, 176, 177, 178, 181, 182, 184, 185, 188, 189, 211, 219, 221, 222, 223, 225, 235, 236, 238 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Terms shown above computed by Lapinot.

LINKS

Andrew Woods, Table of n, a(n) for n = 1..10000

PROG

(Sage)

@cached_function

def A129562(n):

....if n == 1: return 1

....nocommon = lambda x, y: not set(x.digits()).intersection(y.digits())

....last = A129562(n-1)

....return next(k for k in IntegerRange(last+1, infinity) if nocommon(k, last+k) and nocommon(last, last+k))

....# [D. S. McNeil, Aug 31 2011]

CROSSREFS

Sequence in context: A038365 A247761 A031185 * A191841 A050741 A285710

Adjacent sequences:  A129559 A129560 A129561 * A129563 A129564 A129565

KEYWORD

base,easy,nonn

AUTHOR

Eric Angelini, May 30 2007

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 08:51 EST 2017. Contains 294923 sequences.