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,11,91,671,5551,46761,398065,3401871,29120743,249448001,2137362811,
%T 18315799997,156961741753,1345147895869,11527885950497,98794030243881,
%U 846666363905255,7255947727689297,62183631402541039,532915135391447739
%N Number of base 11 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
%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