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 A126477 #9 Jun 01 2017 12:06:14
%S A126477 1,9,51,301,1787,10619,63111,375091,2229307,13249619,78747531,
%T A126477 468026571,2781660187,16532466059,98258743211,583989138891,
%U A126477 3470869901227,20628701920939,122604233247851,728683659684651
%N A126477 Number of base 9 n-digit numbers with adjacent digits differing by three or less.
%C A126477 [Empirical] a(base,n)=a(base-1,n)+7^(n-1) for base>=3n-2; a(base,n)=a(base-1,n)+7^(n-1)-2 when base=3n-3.
%F A126477 Conjectures from _Colin Barker_, Jun 01 2017: (Start)
%F A126477 G.f.: (1 + 2*x - 6*x^2 + 2*x^4) / ((1 - x)*(1 - 6*x + 2*x^3)).
%F A126477 a(n) = 7*a(n-1) - 6*a(n-2) - 2*a(n-3) + 2*a(n-4) for n>4.
%F A126477 (End)
%o A126477 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-2](($[i]`-$[i+1]`>3)+($[i+1]`-$[i]`>3))
%Y A126477 Cf. Base 9 differing by two or less A126396, one or less A126363.
%K A126477 nonn,base
%O A126477 0,2
%A A126477 _R. H. Hardin_, Dec 27 2006