|
%I #10 Oct 11 2023 10:32:22
%S 8,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39,41,43,45,47,49,51,
%T 53,55,57,59,61,63,65,67,69,71,73,75,77,79,81,83,85,87,89,91,93,95,97,
%U 99,101,103,105,107,109,111,113,115,117,119,121,123,125,127,129,131,133
%N Number of (not necessarily maximal) cliques in the n-cycle graph.
%C Also the number of independent vertex sets in the complement of the n-cycle graph. - _Eric W. Weisstein_, Oct 11 2023
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Clique.html">Clique</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CycleComplementGraph.html">Cycle Complement Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CycleGraph.html">Cycle Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/IndependentVertexSet.html">Independent Vertex Set</a>
%F a(n) = 2*n+1 for n > 3.
%K nonn,easy
%O 3,1
%A _Eric W. Weisstein_, Jun 09 2019
|
