login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125398 Number of base 10 circular n-digit numbers with adjacent digits differing by 6 or less. 0

%I #11 Jun 01 2017 12:05:15

%S 1,10,88,724,6412,57120,510214,4559754,40756276,364302976,3256378378,

%T 29107705802,260184449794,2325705707374,20788741351382,

%U 185823928401414,1661020831456212,14847335474122436,132715596660687976

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

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

%F G.f.: (1 - 6*x^2 - 64*x^3 + 15*x^4 + 88*x^5 - 5*x^6 - 24*x^7) / ((1 - 2*x - x^2 + x^3)*(1 - 8*x - 9*x^2 + 5*x^3 + 4*x^4)) (conjectured). - _Colin Barker_, Jun 01 2017

%o (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>6)+($[(i+1)mod N]`-$[i]`>6))

%K nonn,base

%O 0,2

%A _R. H. Hardin_, Dec 28 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)