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 A126476 #9 Jun 01 2017 12:06:07
%S A126476 1,8,44,252,1446,8300,47642,273466,1569700,9010108,51718192,296863410,
%T A126476 1704001644,9781001986,56143138234,322262685896,1849793972828,
%U A126476 10617852738356,60946677537854,349835093256180,2008060117756986
%N A126476 Number of base 8 n-digit numbers with adjacent digits differing by three or less.
%C A126476 [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 A126476 Conjectures from _Colin Barker_, Jun 01 2017: (Start)
%F A126476 G.f.: (1 - x)*(1 + 3*x - x^3) / (1 - 6*x + x^2 + 3*x^3 - x^4).
%F A126476 a(n) = 6*a(n-1) - a(n-2) - 3*a(n-3) + a(n-4) for n>4.
%F A126476 (End)
%o A126476 (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 A126476 Cf. Base 8 differing by two or less A126395, one or less A126362.
%K A126476 nonn,base
%O A126476 0,2
%A A126476 _R. H. Hardin_, Dec 27 2006