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 A125367 #9 Apr 30 2025 15:17:33
%S A125367 1,30,250,1650,12770,100230,805906,6566814,54086114,449108706,
%T A125367 3753661210,31540650842,266200099346,2255103585986,19164991781962,
%U A125367 163321999341570,1395146780098946,11942807195629546,102422953911204100
%N A125367 Number of base 30 circular n-digit numbers with adjacent digits differing by 4 or less.
%C A125367 [Empirical] a(base,n)=a(base-1,n)+A025014(n+1) for base>=4.int(n/2)+1
%H A125367 OEIS Wiki, <a href="/wiki/Number_of_base_k_circular_n-digit_numbers_with_adjacent_digits_differing_by_d_or_less">Number of base k circular n-digit numbers with adjacent digits differing by d or less</a>
%o A125367 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>4)+($[(i+1)mod N]`-$[i]`>4))
%K A125367 nonn,base
%O A125367 0,2
%A A125367 _R. H. Hardin_, Dec 28 2006