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 #4 Sep 16 2015 04:41:37
%S 0,1,2,6,8,10,11,12,13,14,15,17,20,21,22,24,26,27,28,29,30,31,32,35,
%T 36,37,39,40,41,42,44,46,47,50,51,52,53,55,57,60,61,62,63,64,65,67,68,
%U 69,70,71,72,73,74,75,76,78,80,81,82,83,85,87,88,89,90,91,92,94,95,96,97
%N Slowest increasing sequence that starts with 0 and has property that multiplying two consecutive terms gives a number which shares at least one digit with one of the terms.
%C Terms computed by _Stefan Steinerberger_.
%t a = {0}; For[n = 1, n <= 100, n++, If[Length[Intersection[IntegerDigits[n*a[[ -1]]], Union[IntegerDigits[n], IntegerDigits[a[[ -1]]]]]] != 0, AppendTo[a, n]]]; a
%K base,easy,nonn
%O 0,3
%A _Eric Angelini_, May 29 2007