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 A126397 #10 May 31 2017 13:18:20
%S A126397 1,10,44,200,918,4236,19598,90790,420870,1951636,9051480,41983154,
%T A126397 194736668,903293618,4190003458,19435777562,90155141564,418195731384,
%U A126397 1939853565942,8998257693932,41739569773726,193614349514214
%N A126397 Number of base 10 n-digit numbers with adjacent digits differing by two or less.
%C A126397 [Empirical] a(base,n)=a(base-1,n)+5^(n-1) for base>=2n-1; a(base,n)=a(base-1,n)+5^(n-1)-2 when base=2n-2.
%F A126397 Conjectures from _Colin Barker_, May 31 2017: (Start)
%F A126397 G.f.: (1 + 3*x - 15*x^2 + 2*x^3 + x^4) / (1 - 7*x + 11*x^2 - x^4).
%F A126397 a(n) = 7*a(n-1) - 11*a(n-2) + a(n-4) for n>4.
%F A126397 (End)
%o A126397 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-2](($[i]`-$[i+1]`>2)+($[i+1]`-$[i]`>2))
%Y A126397 Cf. Base 10 differing by one or less A126364.
%K A126397 nonn,base
%O A126397 0,2
%A A126397 _R. H. Hardin_, Dec 28 2006