The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #8 Mar 31 2012 12:35:02
%S 1,23,319,3767,51151,709643,10047997,143871219,2074700383,30047531747,
%T 436316634759,6345752320051,92380289359093,1345627928276083,
%U 19607422887447847,285762990007119467,4165291580685012543
%N Number of base 23 circular n-digit numbers with adjacent digits differing by 8 or less.
%C [Empirical] a(base,n)=a(base-1,n)+F(8) for base>=8.int(n/2)+1 and F(d) is the largest coefficient in (1+x+...+x^(2d))^n
%o (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>8)+($[(i+1)mod N]`-$[i]`>8))
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006