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.

A332936 Number of blue nodes in n-th power graph W exponentiation of a cycle graph with 7 blue nodes and 1 green node.

This page as a plain text file.
%I A332936 #24 Apr 30 2020 10:05:20
%S A332936 7,51,387,2943,22383,170235,1294731,9847143,74892951,569602179,
%T A332936 4332138579,32948302095,250590001023,1905875101899,14495230812123,
%U A332936 110244221191287,838468077093927,6377011953177555,48500691394138659,368874495293576607,2805493888166196879,21337327619448845211
%N A332936 Number of blue nodes in n-th power graph W exponentiation of a cycle graph with 7 blue nodes and 1 green node.
%C A332936 The series of green nodes in n-th power W exponentiation for all n<6 n blue 1 green, 2 edge per node graphs already corresponds with an existing OEIS sequence (empirical). For example the number of blue nodes in n-th power W exponentiation of a square containing 3 blue nodes and 1 green node corresponds to A163063.
%H A332936 George Strand Vajagich, <a href="https://youtu.be/o7_L_Mo-xpU">Youtube video explaining graph W multiplication</a>, YouTube video.
%H A332936 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (8,-3).
%F A332936 g(n) = g(n-1) + 2*a(n-1), a(n) = 2*g(n-1) + 7*a(n-1) with g(0) = 1 and b(0) = 7, where g(n) = A332211(n).
%F A332936 From _Colin Barker_, Mar 03 2020: (Start)
%F A332936 G.f.: (1 + 43*x - 18*x^2) / (1 - 8*x + 3*x^2).
%F A332936 a(n) = 8*a(n-1) - 3*a(n-2) for n > 1.
%F A332936 (End)
%F A332936 From _Stefano Spezia_, Mar 03 2020: (Start)
%F A332936 a(n) = ((4 - sqrt(13))^n*(-23 + 7*sqrt(13)) + (4 + sqrt(13))^n*(23 + 7*sqrt(13)))/(2*sqrt(13)).
%F A332936 E.g.f.: exp(4*x)*(91*cosh(sqrt(13)*x) + 23*sqrt(13)*sinh(sqrt(13)*x))/13.
%F A332936 (End)
%F A332936 a(n) = 7*A190976(n+1) -5*A190976(n). - _R. J. Mathar_, Apr 30 2020
%e A332936 For n = 2 take g(1)=15 and b(1)=51. Multiply b(1) by 7 to get 357 add 30 to get 387.
%e A332936 For n = 3 take g(2)=117 and b(2)=387. Multiply b(2) by 7 to get 774 add 234 to get 2943.
%o A332936 (Python)
%o A332936 g=1
%o A332936 b=7
%o A332936 sg=0
%o A332936 sb=0
%o A332936 bl=[]
%o A332936 gl=[]
%o A332936 for int in range(1,20):
%o A332936   sg=g*1+b*2
%o A332936   sb=b*7+g*2
%o A332936   g=sg
%o A332936   b=sb
%o A332936   gl.append(g)
%o A332936   bl.append(b)
%o A332936 print(bl)
%o A332936 (PARI) Vec((1 + 43*x - 18*x^2) / (1 - 8*x + 3*x^2) + O(x^40)) \\ _Colin Barker_, Mar 03 2020
%Y A332936 Cf. A331211.
%K A332936 nonn,easy
%O A332936 0,1
%A A332936 _George Strand Vajagich_, Mar 02 2020