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.

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

This page as a plain text file.
%I A125344 #12 Apr 30 2025 15:09:48
%S A125344 1,7,43,247,1527,9497,59245,369803,2308687,14413783,89990323,
%T A125344 561842893,3507795765,21900487967,136732988323,853675514807,
%U A125344 5329817595487,33276057627697,207754954396765,1297092388823683,8098236068810727
%N A125344 Number of base 7 circular n-digit numbers with adjacent digits differing by 4 or less.
%C A125344 [Empirical] a(base,n)=a(base-1,n)+A025014(n+1) for base>=4.int(n/2)+1.
%H A125344 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 A125344 G.f.: (1 - 3*x^2 - 22*x^3 + 3*x^4 + 12*x^5) / ((1 - x - x^2)*(1 - 6*x - 2*x^2 + 3*x^3)) (conjectured). - _Colin Barker_, Jun 03 2017
%o A125344 (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 A125344 nonn,base
%O A125344 0,2
%A A125344 _R. H. Hardin_, Dec 28 2006