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 A125316 #13 Apr 30 2025 14:57:49
%S A125316 1,6,30,138,694,3526,18012,92140,471566,2413794,12356010,63250314,
%T A125316 323779348,1657433992,8484446994,43432107538,222330112286,
%U A125316 1138113767838,5826034724844,29823627148788,152667942902854
%N A125316 Number of base 6 circular n-digit numbers with adjacent digits differing by 3 or less.
%C A125316 [Empirical] a(base,n)=a(base-1,n)+A025012(n+1) for base>=3.int(n/2)+1.
%H A125316 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 A125316 Conjectures from _Colin Barker_, Jun 04 2017: (Start)
%F A125316 G.f.: (1 - 3*x^2 - 16*x^3 + 3*x^4 + 8*x^5) / ((1 - x - x^2)*(1 - 5*x - x^2 + 2*x^3)).
%F A125316 a(n) = 6*a(n-1) - 3*a(n-2) - 8*a(n-3) + a(n-4) + 2*a(n-5) for n>5.
%F A125316 (End)
%o A125316 (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 A125316 nonn,base
%O A125316 0,2
%A A125316 _R. H. Hardin_, Dec 28 2006