Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125485
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125485 Number of base 28 circular n-digit numbers with adjacent digits differing by 9 or less. +0
1
1, 28, 442, 5878, 90262, 1415878, 22695076, 368310712, 6028038286, 99207708814, 1638704629522, 27132638036202, 449943629944228, 7468996856620028, 124065300876811890, 2061684054575682598, 34269888230469320798 (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: A121803 A022656 A154588 this_sequence A054337 A009685 A007833

Adjacent sequences: A125482 A125483 A125484 this_sequence A125486 A125487 A125488

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 December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research