cp's OEIS Frontend

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.

A125345 Number of base 8 circular n-digit numbers with adjacent digits differing by 4 or less.

This page as a plain text file.
%I A125345 #13 Apr 30 2025 15:10:10
%S A125345 1,8,52,308,2012,13308,88582,590710,3941716,26308100,175600282,
%T A125345 1172118538,7823866514,52224288462,348597313326,2326889050098,
%U A125345 15531999290132,103676198275324,692039319384424,4619367120609720
%N A125345 Number of base 8 circular n-digit numbers with adjacent digits differing by 4 or less.
%C A125345 [Empirical] a(base,n)=a(base-1,n)+A025014(n+1) for base>=4.int(n/2)+1
%H A125345 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>
%F A125345 G.f.: (1 - 6*x^2 - 40*x^3 + 15*x^4 + 48*x^5 - 5*x^6 - 12*x^7) / ((1 - 2*x - x^2 + x^3)*(1 - 6*x - 5*x^2 + 3*x^3 + 2*x^4)) (conjectured). - _Colin Barker_, Jun 03 2017
%o A125345 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-1](($[i]`-$[(i+1)mod N]`>4)+($[(i+1)mod N]`-$[i]`>4))
%K A125345 nonn,base
%O A125345 0,2
%A A125345 _R. H. Hardin_, Dec 28 2006