login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125373 Number of base 10 circular n-digit numbers with adjacent digits differing by 5 or less. 2
1, 10, 80, 580, 4660, 37960, 311378, 2559658, 21057948, 173287588, 1426133270, 11737272106, 96600478510, 795047628502, 6543462720560, 53854541701240, 443238127915788, 3647975524214452, 30023874009147704, 247105006940966092 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

[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

LINKS

Table of n, a(n) for n=0..19.

Index entries for linear recurrences with constant coefficients, signature (11, -21, -19, 34, 8, -15, -1, 2).

FORMULA

G.f.: (1 - x - 9*x^2 - 71*x^3 + 116*x^4 + 52*x^5 - 87*x^6 - 9*x^7 + 16*x^8)/((1 + x)(1 - 3*x + x^3)(1 - 9*x + 6*x^2 + 3*x^3 - 2*x^4)). For n<4, a(n) = 5*6^n-4*5^n = A257286(n). - M. F. Hasler, May 03 2015

MATHEMATICA

LinearRecurrence[{11, -21, -19, 34, 8, -15, -1, 2}, {1, 10, 80, 580, 4660, 37960, 311378, 2559658, 21057948}, 30] (* Harvey P. Dale, May 14 2018 *)

PROG

(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))

CROSSREFS

Sequence in context: A055285 A036070 A257286 * A093145 A037509 A037692

Adjacent sequences:  A125370 A125371 A125372 * A125374 A125375 A125376

KEYWORD

nonn,base

AUTHOR

R. H. Hardin, Dec 28 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 13:15 EST 2020. Contains 338947 sequences. (Running on oeis4.)