|
%I #10 Aug 12 2023 11:27:07
%S 1,31,149,559,2457,10861,49253,226033,1048177,4898197,23033019,
%T 108861553,516705009,2461341589,11760895827,56346974689,270594033729,
%U 1302160086037,6277836418979,30315976817857,146614887333487
%N Number of base 31 circular n-digit numbers with adjacent digits differing by 2 or less.
%C [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1.
%C See A285280 for confirmation of linear recurrence and code to produce sequence. - _Ray Chandler_, Aug 12 2023.
%H Ray Chandler, <a href="/A124994/b124994.txt">Table of n, a(n) for n = 0..99</a>
%H <a href="/index/Rec#order_31">Index entries for linear recurrences with constant coefficients</a>, signature (31, -406, 2842, -10620, 13482, 47644, -203320, 116472, 718520, -1203203, -1067623, 3598942, 266418, -6000745, 1487245, 6344334, -2536210, -4431623, 2057355, 2052819, -971343, -616179, 272587, 113730, -43330, -11711, 3451, 553, -105, -7, 1).
%o (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))
%Y Cf. Row 31 of A285280.
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006
|
