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 A124804 #12 Apr 30 2025 14:06:36
%S A124804 1,32,94,218,586,1562,4288,11876,33250,93746,265924,757976,2169316,
%T A124804 6229892,17944006,51816578,149965330,434882642,1263332452,3675765416,
%U A124804 10710126976,31246397456,91266942586,266864938646,781080332332
%N A124804 Number of base 32 circular n-digit numbers with adjacent digits differing by 1 or less.
%C A124804 [Empirical] a(base,n)=a(base-1,n)+A002426(n+1) for base>=1.int(n/2)+1
%C A124804 a(n) = T(n, 32) 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,..,32}. See theorem 3.3 in Knopfmacher and others, reference in A124696. - _Peter Luschny_, Aug 13 2012
%H A124804 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 A124804 (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 A124804 nonn,base
%O A124804 0,2
%A A124804 _R. H. Hardin_, Dec 28 2006