Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Feb 20 2023 05:15:34
%S 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,
%T 43,44,45,46,47,48,51,149,151,152,154,155,165,167,168,169,171,172,176,
%U 177,178,181,182,184,185,188,189,211,219,221,222,223,225,235,236,238
%N 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.
%C Terms shown above computed by Lapinot.
%H Andrew Woods, <a href="/A129562/b129562.txt">Table of n, a(n) for n = 1..10000</a>
%o (Sage)
%o @cached_function
%o def A129562(n):
%o if n == 1: return 1
%o nocommon = lambda x,y: not set(x.digits()).intersection(y.digits())
%o last = A129562(n-1)
%o return next(k for k in IntegerRange(last+1,infinity) if nocommon(k,last+k) and nocommon(last,last+k))
%o # _D. S. McNeil_, Aug 31 2011
%K base,easy,nonn
%O 1,2
%A _Eric Angelini_, May 30 2007