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.

A051931 Number of independent sets of nodes in graph K_6 X C_n (n > 2).

This page as a plain text file.
%I A051931 #29 Jul 02 2025 16:01:58
%S A051931 7,1,43,229,1447,8881,54763,337429,2079367,12813601,78961003,
%T A051931 486579589,2998438567,18477210961,113861704363,701647437109,
%U A051931 4323746327047,26644125399361,164188498723243,1011775117738789,6234839205156007,38420810348674801,236759701297204843
%N A051931 Number of independent sets of nodes in graph K_6 X C_n (n > 2).
%H A051931 Vincenzo Librandi, <a href="/A051931/b051931.txt">Table of n, a(n) for n = 0..1000</a>
%H A051931 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (5,7,1).
%F A051931 a(n) = 5*a(n-1) + 7*a(n-2) + a(n-3).
%F A051931 G.f.: (7 - 34*x - 11*x^2) / ((1 + x)*(1 - 6*x - x^2)). - _Colin Barker_, Apr 18 2012
%F A051931 From _Colin Barker_, Nov 24 2017: (Start)
%F A051931 a(n) = (3 - sqrt(10))^n + (3 + sqrt(10))^n + 5 for n even.
%F A051931 a(n) = (3 - sqrt(10))^n + (3 + sqrt(10))^n - 5 for n odd.
%F A051931 (End)
%t A051931 CoefficientList[Series[(7-34*x-11*x^2)/((1+x)*(1-6*x-x^2)),{x,0,30}],x] (* _Vincenzo Librandi_, Apr 27 2012 *)
%o A051931 (Magma) I:=[7, 1, 43]; [n le 3 select I[n] else 5*Self(n-1)+7*Self(n-2)+Self(n-3): n in [1..25]]; // _Vincenzo Librandi_, Apr 27 2012
%o A051931 (PARI) Vec((7 - 34*x - 11*x^2) / ((1 + x)*(1 - 6*x - x^2)) + O(x^40)) \\ _Colin Barker_, Nov 24 2017
%Y A051931 Row 6 of A287376.
%K A051931 easy,nonn
%O A051931 0,1
%A A051931 _Stephen G Penrice_, Dec 19 1999
%E A051931 More terms from _James Sellers_, Dec 20 1999