|
Search: id:A125393
|
|
|
| A125393 |
|
Number of base 30 circular n-digit numbers with adjacent digits differing by 5 or less. |
|
+0
1
|
|
| 1, 30, 300, 2400, 22480, 213980, 2086194, 20618474, 205995176, 2075017056, 21039273910, 214459190558, 2195640154606, 22561546844854, 232553020432522, 2403380361008210, 24894780141389160, 258371506856822688
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
[Empirical] a(base,n)=a(base-1,n)+F(5) for base>=5.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]`>5)+($[(i+1)mod N]`-$[i]`>5))
|
|
CROSSREFS
|
Sequence in context: A129029 A101381 A061605 this_sequence A126551 A042750 A074994
Adjacent sequences: A125390 A125391 A125392 this_sequence A125394 A125395 A125396
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ron Hardin (rhhardin(AT)att.net), Dec 28 2006
|
|
|
Search completed in 0.002 seconds
|
