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.

A228306 The Wiener index of the Kneser graph K(n,2) (n>=5).

This page as a plain text file.
%I A228306 #8 Feb 16 2025 08:33:20
%S A228306 75,165,315,546,882,1350,1980,2805,3861,5187,6825,8820,11220,14076,
%T A228306 17442,21375,25935,31185,37191,44022,51750,60450,70200,81081,93177,
%U A228306 106575,121365,137640,155496,175032,196350,219555,244755,272061,301587,333450
%N A228306 The Wiener index of the Kneser graph K(n,2) (n>=5).
%C A228306 The Kneser graph K(n,2) is the graph whose vertices represent the 2-subsets of {1,2,...,n} and two vertices are connected if and only if they correspond to disjoint subsets.
%C A228306 K(n,2) is disconnected for n<=4.
%C A228306 K(5,2) is the Petersen graph.
%C A228306 The Kneser graph K(n,2) is distance-regular with intersection array [(n-2)*(n-3)/2, 2*(n-4); 1, (n-3)*(n-4)/2].
%D A228306 R. Balakkrishnan, S. Francis Raj, The Wiener number of Kneser graphs, Discussiones Math, Graph Theory, 28, 2008, 219-228.
%H A228306 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KneserGraph.html">Kneser Graph</a>.
%H A228306 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (5,-10,10,-5,1).
%F A228306 a(n) = (1/8)*n*(n-1)*(n-2)*(n+5).
%F A228306 G.f.: 3*x^5*(25-70*x+80*x^2-43*x^3+9*x^4)/(1-x)^5.
%F A228306 The Hosoya-Wiener polynomial of K(n,2) is (1/8)*n*(n-1)*(n-2)*t*(n-3+4*t).
%p A228306 a := proc (n) options operator, arrow: (1/8)*n*(n-1)*(n-2)*(n+5) end proc: seq(a(n), n = 5 .. 40);
%Y A228306 Cf. A228307
%K A228306 nonn,easy
%O A228306 5,1
%A A228306 _Emeric Deutsch_, Aug 20 2013