login
Number of (not necessarily maximal) cliques in the n-dipyramidal graph.
0

%I #16 Feb 16 2025 08:33:55

%S 24,27,33,39,45,51,57,63,69,75,81,87,93,99,105,111,117,123,129,135,

%T 141,147,153,159,165,171,177,183,189,195,201,207,213,219,225,231,237,

%U 243,249,255,261,267,273,279,285,291,297,303

%N Number of (not necessarily maximal) cliques in the n-dipyramidal graph.

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Clique.html">Clique</a>

%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/DipyramidalGraph.html">Dipyramidal Graph</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Clique_(graph_theory)">Clique</a>

%F a(n) = 6*n+3 for n > 3.

%t Join[{24},6*Range[4,50]+3] (* _Harvey P. Dale_, Jan 16 2023 *)

%K nonn,easy

%O 3,1

%A _Eric W. Weisstein_, Jun 10 2019