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 A125318 #13 Apr 30 2025 15:00:35
%S A125318 1,8,44,212,1156,6428,36338,206942,1183164,6777860,38866134,222980282,
%T A125318 1279588414,7343932838,42151639560,241943513252,1388738207756,
%U A125318 7971319975484,45755345035400,262636025020328,1507534275820126
%N A125318 Number of base 8 circular n-digit numbers with adjacent digits differing by 3 or less.
%C A125318 [Empirical] a(base,n)=a(base-1,n)+A025012(n+1) for base>=3.int(n/2)+1
%H A125318 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>
%F A125318 G.f.: (1 - 10*x^2 - 40*x^3 + 45*x^4 + 48*x^5 - 35*x^6 - 12*x^7 + 7*x^8) / ((1 + x)*(1 - 3*x + x^3)*(1 - 6*x + x^2 + 3*x^3 - x^4)) (conjectured). - _Colin Barker_, Jun 03 2017
%o A125318 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>3)+($[(i+1)mod N]`-$[i]`>3))
%K A125318 nonn,base
%O A125318 0,2
%A A125318 _R. H. Hardin_, Dec 28 2006