|
%I #10 Aug 12 2023 11:30:01
%S 1,32,154,578,2542,11242,51004,234168,1086342,5078522,23889964,
%T 112953048,536316184,2555650688,12215701582,58545624238,281245522518,
%U 1353858728442,6529181968828,31539774822672,152581524133232
%N Number of base 32 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="/A124998/b124998.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 (32, -435, 3190, -12761, 19684, 48086, -258700, 231499, 837384, -1863852, -875664, 5434855, -1213796, -9107594, 4936580, 9823160, -7075200, -7101166, 5814524, 3467879, -2974948, -1126675, 951098, 234114, -182448, -28910, 19180, 1855, -924, -49, 14).
%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 32 of A285280.
%K nonn,base
%O 0,2
%A _R. H. Hardin_, Dec 28 2006
|
