Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125403
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125403 Number of base 15 circular n-digit numbers with adjacent digits differing by 6 or less. +0
1
1, 15, 153, 1359, 13733, 141695, 1486035, 15703213, 166605917, 1771212519, 18849404803, 200701390047, 2137554688991, 22768882319185, 242546650726001, 2583827618792249, 27525752610673389, 293236893096648653 (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: A041424 A021124 A004322 this_sequence A010035 A017389 A098685

Adjacent sequences: A125400 A125401 A125402 this_sequence A125404 A125405 A125406

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 September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research