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.
%I A051932 #28 Jul 02 2025 16:01:58
%S A051932 8,1,57,358,2605,18551,132504,946037,6754805,48229630,344362257,
%T A051932 2458765387,17555720008,125348805401,894997357857,6390330310358,
%U A051932 45627309530405,325781497023151,2326097788692504,16608466017870637,118585359913787005,846705985414379630
%N A051932 Number of independent sets of nodes in graph K_7 X C_n (n > 2).
%H A051932 Colin Barker, <a href="/A051932/b051932.txt">Table of n, a(n) for n = 0..1000</a>
%H A051932 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (6,8,1).
%F A051932 a(n) = 6*a(n-1) + 8*a(n-2) + a(n-3).
%F A051932 G.f.: (13*x^2+47*x-8)/(x^3+8*x^2+6*x-1). - _Harvey P. Dale_, Sep 11 2011
%t A051932 LinearRecurrence[{6,8,1},{8,1,57},20] (* _Harvey P. Dale_, Sep 11 2011 *)
%o A051932 (PARI) Vec((8 - 47*x - 13*x^2) / ((1 + x)*(1 - 7*x - x^2)) + O(x^30)) \\ _Colin Barker_, May 11 2017
%Y A051932 Row 7 of A287376.
%K A051932 easy,nonn
%O A051932 0,1
%A A051932 _Stephen G Penrice_, Dec 19 1999
%E A051932 More terms from _James Sellers_, Dec 20 1999
%E A051932 Corrected by _T. D. Noe_, Nov 07 2006