|
|
A124851
|
|
Number of base 9 circular n-digit numbers with adjacent digits differing by 2 or less.
|
|
2
|
|
|
1, 9, 39, 141, 587, 2479, 10731, 47063, 208547, 931047, 4180239, 18849103, 85269011, 386687375, 1756855951, 7993210831, 36405316227, 165940691695, 756832203759, 3453347063599, 15762537566627, 71964915505967
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
[Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1.
See A285280 for confirmation of linear recurrence and code to produce sequence; also confirms conjectured g.f. from Colin Barker. - Ray Chandler, Aug 12 2023.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (1 - 21*x^2 - 14*x^3 + 150*x^4 - 16*x^5 - 150*x^6 + 24*x^7 + 28*x^8) / ((1 + x)*(1 - 4*x + 2*x^2)*(1 - 6*x + 5*x^2 + 8*x^3 - 4*x^4 - 2*x^5)). - Colin Barker, Jun 02 2017
|
|
PROG
|
(S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>2)+($[(i+1)mod N]`-$[i]`>2))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|