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 A125321 #13 Apr 30 2025 15:01:41
%S A125321 1,11,65,323,1849,10781,64325,388749,2371457,14559461,89788425,
%T A125321 555446661,3443457697,21379001421,132867762617,826329001973,
%U A125321 5141530912065,32001680946301,199227543918473,1240485517109477
%N A125321 Number of base 11 circular n-digit numbers with adjacent digits differing by 3 or less.
%C A125321 [Empirical] a(base,n)=a(base-1,n)+A025012(n+1) for base>=3.int(n/2)+1
%H A125321 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 A125321 G.f.: (1 - 28*x^2 - 56*x^3 + 318*x^4 + 112*x^5 - 540*x^6 - 48*x^7 + 224*x^8) / ((1 - 4*x - 2*x^2 + 4*x^3)*(1 - 7*x + 2*x^2 + 18*x^3 - 2*x^4 - 8*x^5)) (conjectured). - _Colin Barker_, Jun 03 2017
%o A125321 (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 A125321 nonn,base
%O A125321 0,2
%A A125321 _R. H. Hardin_, Dec 28 2006