|
%I #19 Jan 21 2019 11:20:03
%S 13,76,435,2461,13971,79197,449188,2547179,14445169,81917079,
%T 464547653,2634418076,14939621779,84721638085,480451043995,
%U 2724607324221,15451075136020,87622065595371,496899168779481,2817883624638175,15980039054921477,90621786488479756
%N Number of independent sets of nodes in the generalized Petersen graph G(2n+1,2) (n>=1).
%H Cesar Bautista, <a href="/A182077/b182077.txt">Table of n, a(n) for n = 0..499</a>
%H C. Bautista-Ramos and C. Guillen-Galvan, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Bautista/bautista4.html">Fibonacci numbers of generalized Zykov sums</a>, J. Integer Seq., 15 (2012), Article 12.7.8.
%H Stephan G. Wagner, <a href="https://www.fq.math.ca/Papers1/44-4/quartwagner04_2006.pdf">The Fibonacci Number of Generalized Petersen Graphs</a>, Fibonacci Quarterly, 44 (2006), 362-367.
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (3, 15, 3, -13, 4).
%F a(n) = 3*a(n-1)+15*a(n-2)+3*a(n-3)-13*a(n-4)+4*a(n-5) with a(0)=13,a(1)=76,a(2)=435,a(3)=2461,a(4)=13971.
%F G.f.: (-4*x^4+23*x^3-12*x^2-37*x-13)/(4*x^5-13*x^4+3*x^3+15*x^2+3*x-1).
%t LinearRecurrence[{3,15,3,-13,4},{13,76,435,2461,13971},30] (* _Harvey P. Dale_, Jul 22 2013 *)
%K nonn,easy
%O 0,1
%A _Cesar Bautista_, Apr 10 2012
|
