login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115055 Lower level digraph derived from a voltage graph. 3

%I #21 Sep 08 2022 08:45:23

%S 0,1,0,0,1,3,3,2,6,15,21,24,42,86,138,192,305,546,906,1381,2175,3651,

%T 6042,9582,15225,24901,40836,65748,105364,170796,278184,450017,724968,

%U 1172412,1902321,3080367,4975551,8044478,13029534,21096027,34114553

%N Lower level digraph derived from a voltage graph.

%C Lower level digraph derived from a voltage graph (Gross's covering graph construction) that is a generalized Fibonacci Markov. In matrix terms gives a 6 X 6 Markov with characteristic Polynomial (-1 - x + x^2)*(1 + 2*x + 2*x^2 + x^3 + x^4).

%C This digraph construction gives a complex substructure to the Fibonacci Pisot that is not Pisot. Gross's covering graph constructions called voltage graphs are abstractions from lower level graphs.

%C limit_{n to Infinity} (a(n+1)/a(n)) = Golden Mean.

%D J. L. Gross and T. W. Tucker, Topological Graph Theory, Wiley, 1987; see Figure 2.5 p. 62

%H G. C. Greubel, <a href="/A115055/b115055.txt">Table of n, a(n) for n = 1..1000</a>

%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1,3,3,1).

%F Let M be the 6x6 matrix given by: M = {{0, 0, 0, 0, 1, 1}, {1, 0, 0, 0, 0, 0}, {1, 1, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0}, {0, 0, 1, 1, 0, 0}, {0, 0, 0, 0, 1, 0}}, then v(n) = M.v(n-1), where a(n) = v(n)(1).

%F From _Vladimir Kruchinin_, Oct 12 2011: (Start)

%F G.f.: x/(1-(x+x^2)^3).

%F a(n) = Sum_{k=0..n} binomial(3*k,n-3*k). (End)

%F a(n) = a(n-3) + 3*a(n-4) + 3*a(n-5) + a(n-6). - _G. C. Greubel_, Mar 22 2019

%t (* Gross page 62 voltage group L3 : weights set to one *)

%t M = {{0, 0, 0, 0, 1, 1}, {1, 0, 0, 0, 0, 0}, {1, 1, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0}, {0, 0, 1, 1, 0, 0}, {0, 0, 0, 0, 1, 0}} v[1] = {0, 0, 0, 0, 0, 1} v[n_] := v[n] = M.v[n - 1] a = Table[Floor[v[n][[1]]], {n, 1, 50}]

%t (* alternate program *)

%t LinearRecurrence[{0,0,1,3,3,1}, {0,1,0,0,1,3}, 50] (* _G. C. Greubel_, Mar 22 2019 *)

%o (PARI) my(x='x+O('x^50)); concat([0], Vec(x/(1-(x+x^2)^3))) \\ _G. C. Greubel_, Mar 22 2019

%o (Magma) R<x>:=PowerSeriesRing(Integers(), 50); [0] cat Coefficients(R!( x/(1-(x+x^2)^3) )); // _G. C. Greubel_, Mar 22 2019

%o (Sage) (x/(1-(x+x^2)^3)).series(x, 50).coefficients(x, sparse=False) # _G. C. Greubel_, Mar 22 2019

%o (GAP) a:=[0,1,0,0,1,3];; for n in [7..50] do a[n]:=a[n-3]+3*a[n-4]+ 3*a[n-5]+a[n-6]; od; a; # _G. C. Greubel_, Mar 22 2019

%K nonn

%O 1,6

%A _Roger L. Bagula_, Dec 09 2006

%E Edited by _G. C. Greubel_, Mar 22 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 6 16:55 EDT 2024. Contains 372297 sequences. (Running on oeis4.)