%I #16 Apr 30 2025 15:23:42

%S 1,8,58,398,2902,21238,155716,1142016,8376142,61435910,450611298,

%T 3305081546,24241659940,177804417188,1304135570978,9565395603838,

%U 70158958263262,514592352357838,3774361758858916,27683673535999896

%N Number of base 8 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>

%F G.f.: (1 - 3*x^2 - 28*x^3 + 3*x^4 + 16*x^5) / ((1 - x - x^2)*(1 - 7*x - 3*x^2 + 4*x^3)) (conjectured). - _Colin Barker_, Jun 03 2017

%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