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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125470 Number of base 13 circular n-digit numbers with adjacent digits differing by 9 or less. 0
1, 13, 157, 1813, 21997, 267483, 3255907, 39636855, 482546341, 5874634345, 71519267407, 870693584543, 10600043444419, 129047604857977, 1571058121063511, 19126458200814873, 232850330879455797 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

[Empirical] a(base,n)=a(base-1,n)+F(9) for base>=9.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..16.

FORMULA

G.f.: (1-6*x^2-100*x^3+15*x^4+148*x^5-5*x^6-42*x^7) / ((1-2*x-x^2+x^3)*(1-11*x-15*x^2+8*x^3+7*x^4)) (conjectured). - Colin Barker, Jul 18 2017

PROG

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

CROSSREFS

Sequence in context: A072841 A244206 A159499 * A165151 A016125 A175519

Adjacent sequences:  A125467 A125468 A125469 * A125471 A125472 A125473

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 April 1 14:52 EDT 2020. Contains 333163 sequences. (Running on oeis4.)