This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A124953 #12 Apr 30 2025 14:51:46
%S A124953 1,25,119,445,1947,8575,38747,177223,819187,3816247,17891349,84312583,
%T A124953 399037959,1895486995,9032061297,43155077395,206685100995,
%U A124953 991968231607,4769763119885,22973188788967,110815066535017,535263089155897
%N A124953 Number of base 25 circular n-digit numbers with adjacent digits differing by 2 or less.
%C A124953 [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1.
%C A124953 See A285280 for confirmation of linear recurrence and code to produce sequence. - _Ray Chandler_, Aug 12 2023.
%H A124953 Ray Chandler, <a href="/A124953/b124953.txt">Table of n, a(n) for n = 0..99</a>
%H A124953 OEIS Wiki, <a href="/wiki/Number_of_base_k_circular_n-digit_numbers_with_adjacent_digits_differing_by_d_or_less">Number of base k circular n-digit numbers with adjacent digits differing by d or less</a>
%H A124953 <a href="/index/Rec#order_25">Index entries for linear recurrences with constant coefficients</a>, signature (25, -253, 1265, -2674, -2240, 21374, -23256, -51850, 111350, 49001, -222697, 3926, 248990, -47344, -166462, 41345, 66379, -16465, -14979, 3200, 1700, -265, -75, 5, 1).
%o A124953 (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 A124953 Cf. Row 25 of A285280.
%K A124953 nonn,base
%O A124953 0,2
%A A124953 _R. H. Hardin_, Dec 28 2006