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 A124898 #12 Apr 30 2025 14:47:20
%S A124898 1,17,79,293,1267,5527,24739,112143,513867,2373647,11035789,51580623,
%T A124898 242148559,1141014203,5393615257,25565881003,121473190683,
%U A124898 578379092367,2758998721111,13182804752499,63081972236317,302258226703131
%N A124898 Number of base 17 circular n-digit numbers with adjacent digits differing by 2 or less.
%C A124898 [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1.
%C A124898 See A285280 for confirmation of linear recurrence and code to produce sequence. - _Ray Chandler_, Aug 12 2023.
%H A124898 Ray Chandler, <a href="/A124898/b124898.txt">Table of n, a(n) for n = 0..99</a>
%H A124898 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 A124898 <a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (17, -105, 245, 104, -1274, 912, 2310, -2361, -2039, 2218, 918, -920, -194, 156, 16, -8).
%o A124898 (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 A124898 Cf. Row 17 of A285280.
%K A124898 nonn,base
%O A124898 0,2
%A A124898 _R. H. Hardin_, Dec 28 2006