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 A125346 #15 Apr 30 2025 15:10:34
%S A125346 1,9,61,369,2501,17259,120367,842739,5910189,41476599,291156071,
%T A125346 2044081081,14351282807,100760813695,707450453645,4967087326989,
%U A125346 34874511797933,244858234557953,1719180148930309,12070578961004535
%N A125346 Number of base 9 circular n-digit numbers with adjacent digits differing by 4 or less.
%C A125346 [Empirical] a(base,n)=a(base-1,n)+A025014(n+1) for base>=4.int(n/2)+1
%H A125346 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 A125346 G.f.: (1 - 10*x^2 - 60*x^3 + 45*x^4 + 108*x^5 - 35*x^6 - 54*x^7 + 7*x^8 + 8*x^9) / ((1 + x)*(1 - 3*x + x^3)*(1 - 7*x - x^2 + 6*x^3 - x^5)) (conjectured). - _Colin Barker_, Jun 02 2017
%o A125346 (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))
%Y A125346 Cf. A025014.
%K A125346 nonn,base
%O A125346 0,2
%A A125346 _R. H. Hardin_, Dec 28 2006