%I #10 Apr 30 2025 15:31:01

%S 1,28,278,2218,20698,196378,1908368,18800964,187240242,1880087458,

%T 19001528288,193056703076,1969968657844,20174161922072,

%U 207225426515028,2134025764850968,22024156859681682,227721370771551778

%N Number of base 28 circular n-digit numbers with adjacent digits differing by 5 or less.

%C [Empirical] a(base,n)=a(base-1,n)+F(5) for base>=5.int(n/2)+1 and F(d) is the largest coefficient in (1+x+...+x^(2d))^n

%H 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 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>5)+($[(i+1)mod N]`-$[i]`>5))

%K nonn,base

%O 0,2

%A _R. H. Hardin_, Dec 28 2006