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 A124715 #12 Apr 30 2025 14:00:22
%S A124715 1,22,64,148,396,1052,2878,7946,22180,62356,176394,501446,1431426,
%T A124715 4100482,11781736,33940508,97999060,283533332,821804362,2385796886,
%U A124715 6936333286,20192890166,58855587316,171732657416,501596968522
%N A124715 Number of base 22 circular n-digit numbers with adjacent digits differing by 1 or less.
%C A124715 [Empirical] a(base,n)=a(base-1,n)+A002426(n+1) for base>=1.int(n/2)+1
%C A124715 a(n) = T(n, 22) where T(n, k) = Sum_{j=1..k} (1+2*cos(j*Pi/(k+1)))^n. These are the number of smooth cyclic words of length n over the alphabet {1,2,..,22}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - _Peter Luschny_, Aug 13 2012
%H A124715 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>
%o A124715 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>1)+($[(i+1)mod N]`-$[i]`>1))
%K A124715 nonn,base
%O A124715 0,2
%A A124715 _R. H. Hardin_, Dec 28 2006