Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125401
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125401 Number of base 13 circular n-digit numbers with adjacent digits differing by 6 or less. +0
1
1, 13, 127, 1105, 10795, 107393, 1079611, 10895625, 110142955, 1114176427, 11273835207, 114087679433, 1154585364439, 11684809702241, 118255306926065, 1196798479732385, 12112170879045915, 122581006718527659 (list; graph; listen)
OFFSET

0,2

COMMENT

[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

PROGRAM

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

CROSSREFS

Sequence in context: A142673 A139786 A016169 this_sequence A089763 A124298 A076457

Adjacent sequences: A125398 A125399 A125400 this_sequence A125402 A125403 A125404

KEYWORD

nonn

AUTHOR

Ron Hardin (rhh(AT)cadence.com), Dec 28 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research