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 A124892 #12 Apr 30 2025 14:37:49 %S A124892 1,14,64,236,1012,4384,19486,87738,399372,1832672,8464954,39306138, %T A124892 183315034,858086906,4029197992,18969932356,89518725372,423283210304, %U A124892 2004963114682,9511428021442,45182292435262,214884038667702 %N A124892 Number of base 14 circular n-digit numbers with adjacent digits differing by 2 or less. %C A124892 [Empirical] a(base,n)=a(base-1,n)+A005191(n+1) for base>=2.int(n/2)+1. %C A124892 See A285280 for confirmation of linear recurrence and code to produce sequence. - _Ray Chandler_, Aug 12 2023. %H A124892 Ray Chandler, <a href="/A124892/b124892.txt">Table of n, a(n) for n = 0..99</a> %H A124892 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 A124892 <a href="/index/Rec#order_13">Index entries for linear recurrences with constant coefficients</a>, signature (14, -66, 88, 175, -458, -109, 680, -29, -410, 40, 96, -9, -6). %o A124892 (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 A124892 Cf. Row 14 of A285280. %K A124892 nonn,base %O A124892 0,2 %A A124892 _R. H. Hardin_, Dec 28 2006