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 A124716 #12 Apr 30 2025 14:00:49
%S A124716 1,23,67,155,415,1103,3019,8339,23287,65495,185347,527099,1505215,
%T A124716 4313423,12397963,35728115,103195687,298668263,865957171,2514793739,
%U A124716 7313712655,21298240895,62096722843,181245885539,529545304903
%N A124716 Number of base 23 circular n-digit numbers with adjacent digits differing by 1 or less.
%C A124716 [Empirical] a(base,n)=a(base-1,n)+A002426(n+1) for base>=1.int(n/2)+1
%C A124716 a(n) = T(n, 23) 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,..,23}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - _Peter Luschny_, Aug 13 2012
%H A124716 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 A124716 (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 A124716 nonn,base
%O A124716 0,2
%A A124716 _R. H. Hardin_, Dec 28 2006