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.

A126529 Number of base 8 n-digit numbers with adjacent digits differing by five or less.

This page as a plain text file.
%I A126529 #11 Jun 01 2017 12:06:40
%S A126529 1,8,58,426,3124,22914,168066,1232708,9041498,66316346,486408084,
%T A126529 3567639634,26167436306,191929340708,1407737135338,10325278224266,
%U A126529 75732441613044,555471977422754,4074200053901346,29882886543125508
%N A126529 Number of base 8 n-digit numbers with adjacent digits differing by five or less.
%C A126529 [Empirical] a(base,n)=a(base-1,n)+11^(n-1) for base>=5n-4; a(base,n)=a(base-1,n)+11^(n-1)-2 when base=5n-5.
%F A126529 Conjectures from _Colin Barker_, Jun 01 2017: (Start)
%F A126529 G.f.: (1 + x - x^2) / (1 - 7*x - 3*x^2 + 4*x^3).
%F A126529 a(n) = 7*a(n-1) + 3*a(n-2) - 4*a(n-3) for n>2.
%F A126529 (End)
%o A126529 (S/R) stvar $[N]:(0..M-1) init $[]:=0 asgn $[]->{*} kill +[i in 0..N-2](($[i]`-$[i+1]`>5)+($[i+1]`-$[i]`>5))
%Y A126529 Cf. Base 8 differing by four or less A126503, three or less A126476, two or less A126395, one or less A126362.
%K A126529 nonn,base
%O A126529 0,2
%A A126529 _R. H. Hardin_, Dec 28 2006