This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A278649 #8 Dec 02 2016 20:00:18
%S A278649 1,10,2,12,3,15,5,25,14,7,21,11,13,16,4,20,18,6,24,8,32,22,26,28,34,
%T A278649 27,30,33,36,9,63,39,51,17,19,31,41,61,71,81,23,100,29,102,35,45,50,
%U A278649 55,65,54,52,40,44,48,56,42,38,72,46,92,62,82,104,43,105,37
%N A278649 Lexicographically earliest sequence of distinct terms such that, for any n>0, a(n+1) has a digit that divides a(n) and a(n) has a digit that divides a(n+1).
%C A278649 This sequence combines the constraints met in A218468 and in A257277.
%H A278649 Rémy Sigrist, <a href="/A278649/b278649.txt">Table of n, a(n) for n = 1..10000</a>
%H A278649 Rémy Sigrist, <a href="/A278649/a278649.gp.txt">PARI program for A278649</a>
%t A278649 a = {1}; Do[k = 2; While[Or[Nand[AnyTrue[#2, Divisible[a[[n - 1]], #] &],
%t A278649 AnyTrue[#1, Divisible[k, #] &]], MemberQ[a, k]] & @@ Map[DeleteCases[ IntegerDigits@ #, 0] &, {a[[n - 1]], k}], k++]; AppendTo[a, k], {n, 2, 66}]; a (* _Michael De Vlieger_, Nov 25 2016, Version 10 *)
%Y A278649 Cf. A218468, A257277.
%K A278649 nonn,base
%O A278649 1,2
%A A278649 _Rémy Sigrist_, Nov 25 2016