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 A124950 #12 Apr 30 2025 14:50:32
%S A124950 1,22,104,388,1692,7432,33494,152818,704692,3275272,15320514,72038098,
%T A124950 340204434,1612559698,7667644032,36559128748,174730634628,
%U A124950 836872304392,4015726470338,19301794774522,92915156135782,447886264698862
%N A124950 Number of base 22 circular n-digit numbers with adjacent digits differing by 2 or less.
%C A124950 [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1.
%C A124950 See A285280 for confirmation of linear recurrence and code to produce sequence. - _Ray Chandler_, Aug 12 2023.
%H A124950 Ray Chandler, <a href="/A124950/b124950.txt">Table of n, a(n) for n = 0..99</a>
%H A124950 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 A124950 <a href="/index/Rec#order_20">Index entries for linear recurrences with constant coefficients</a>, signature (23, -213, 973, -1924, -914, 10569, -11449, -15587, 33579, 4445, -38653, 8193, 21819, -7612, -6108, 2405, 765, -285, -35, 10).
%o A124950 (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 A124950 Cf. Row 22 of A285280.
%K A124950 nonn,base
%O A124950 0,2
%A A124950 _R. H. Hardin_, Dec 28 2006