Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125477
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125477 Number of base 20 circular n-digit numbers with adjacent digits differing by 9 or less. +0
1
1, 20, 290, 3710, 53630, 790670, 11804384, 177140396, 2664526934, 40121436206, 604415162550, 9107184376046, 137237515952000, 2068136987970632, 31166901568081520, 469690150305370760, 7078330364431520854 (list; graph; listen)
OFFSET

0,2

COMMENT

[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

PROGRAM

(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: A016314 A021164 A017918 this_sequence A016261 A016309 A016259

Adjacent sequences: A125474 A125475 A125476 this_sequence A125478 A125479 A125480

KEYWORD

nonn

AUTHOR

Ron Hardin (rhhardin(AT)att.net), 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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research