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 A366068 #42 Dec 11 2023 01:27:44
%S A366068 1263907548,1263908457,1275480639,1275480936,1326708549,1326709458,
%T A366068 1327608549,1327609458,1349067258,1349076258,1349085267,1349085276,
%U A366068 1358067249,1358076249,1358094267,1358094276,1362708549,1362709458,1367085249,1367094258,1367208549,1367209458,1367245809,1367249058,1367249085,1367254908,1367258049,1367258094,1427086359,1427095368,1435907268
%N A366068 Numbers having exactly 10 distinct digits arranged in such a way that the sum of any pair of adjacent digits is a substring of the number.
%C A366068 There are 2778 numbers with this property and the last one is 9817263540.
%H A366068 Michael S. Branicky, <a href="/A366068/b366068.txt">Table of n, a(n) for n = 1..2778</a>
%e A366068 The first term is 1263907548 and we see that the 9 successive sums of two adjacent digits are, from left to right, 1+2 (=3), 2+6 (=8), 6+3 (=9), 3+9 (=12), 9+0 (=9), 0+7 (=7), 7+5 (=12), 5+4 (=9) and 4+8 (=12); the results between brackets are substrings of the first term.
%o A366068 (Python)
%o A366068 from itertools import permutations
%o A366068 def afull(): return [int(s) for s in ("".join(c) for c in permutations("0123456789") if c[0]!="0") if all(str(sum(map(int, s[i:i+2]))) in s for i in range(len(s)-1))] # _Michael S. Branicky_, Oct 15 2023
%Y A366068 Cf. A236402.
%K A366068 base,fini,full,nonn
%O A366068 1,1
%A A366068 _Eric Angelini_ and _Giorgos Kalogeropoulos_, Oct 15 2023