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 A124935 #12 Apr 30 2025 14:48:14
%S A124935 1,18,84,312,1352,5908,26490,120278,552032,2553972,11892734,55672118,
%T A124935 261759734,1235323302,5848421012,27764530552,132124679472,
%U A124935 630077734772,3010344270942,14406602755262,69048608938842,331383832210022
%N A124935 Number of base 18 circular n-digit numbers with adjacent digits differing by 2 or less.
%C A124935 [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1.
%C A124935 See A285280 for confirmation of linear recurrence and code to produce sequence. - _Ray Chandler_, Aug 12 2023.
%H A124935 Ray Chandler, <a href="/A124935/b124935.txt">Table of n, a(n) for n = 0..99</a>
%H A124935 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 A124935 <a href="/index/Rec#order_16">Index entries for linear recurrences with constant coefficients</a>, signature (18, -120, 320, 14, -1624, 1767, 2860, -4610, -2408, 4913, 1016, -2500, -200, 580, 16, -48).
%o A124935 (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 A124935 Cf. Row 18 of A285280.
%K A124935 nonn,base
%O A124935 0,2
%A A124935 _R. H. Hardin_, Dec 28 2006