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 A285696 #6 Apr 30 2017 23:14:47
%S A285696 110,11112,33000,110110,313122,1111114,1133200,1303102,1333004,
%T A285696 1531202,3103120,3130210,3300112,3330014,3333222,3501122,3531024,
%U A285696 5113220,5310212,5313024,5500000,5511222,11011112,11033000,11112110,11313142,13030010,15013020,31312114
%N A285696 Numbers such that the path described in Comments visits all digits once and ends in the position immediately after the last digit.
%C A285696 Let d(1..k) be the digits in the number and let i = 1. If d(i) is odd set i = i+d(i)+1 else i = i-d(i)-1. The number is a term if i reaches k+1.
%H A285696 Lars Blomberg, <a href="/A285696/b285696.txt">Table of n, a(n) for n = 1..10000</a>
%F A285696 Numbers must start with 1, 3, 5, 7, 9 and end with 0, 2, 4, 6, 8.
%F A285696 Let eSum = Sum_{i=1..k, d(i) is even} d(i)+1, and oSum = Sum_{i=1..k, d(i) is odd} d(i)+1. Then eSum-oSum+k = 0.
%e A285696 For 33000 the digit positions visited are 1, 5, 4, 3, 2, 6(outside to the right) so 33000 is a term.
%Y A285696 Cf. A284591, A285471, A285695.
%K A285696 nonn,base
%O A285696 1,1
%A A285696 _Lars Blomberg_ and _Eric Angelini_, Apr 25 2017