Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125466
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125466 Number of base 31 circular n-digit numbers with adjacent digits differing by 8 or less. +0
1
1, 31, 455, 5503, 77399, 1110451, 16305215, 242704675, 3649992607, 55305511789, 842747008815, 12896518373649, 197988896900735, 3046905470601517, 46975007273893153, 725216490511279543, 11207606597478569967 (list; graph; listen)
OFFSET

0,2

COMMENT

[Empirical] a(base,n)=a(base-1,n)+F(8) for base>=8.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]`>8)+($[(i+1)mod N]`-$[i]`>8))

CROSSREFS

Sequence in context: A022723 A084234 A118196 this_sequence A142280 A010947 A022626

Adjacent sequences: A125463 A125464 A125465 this_sequence A125467 A125468 A125469

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 3 16:57 EST 2008. Contains 151279 sequences.


AT&T Labs Research