login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A308603
Number of (not necessarily maximal) cliques in the n-dipyramidal graph.
0
24, 27, 33, 39, 45, 51, 57, 63, 69, 75, 81, 87, 93, 99, 105, 111, 117, 123, 129, 135, 141, 147, 153, 159, 165, 171, 177, 183, 189, 195, 201, 207, 213, 219, 225, 231, 237, 243, 249, 255, 261, 267, 273, 279, 285, 291, 297, 303
OFFSET
3,1
LINKS
Eric Weisstein's World of Mathematics, Clique
Eric Weisstein's World of Mathematics, Dipyramidal Graph
Wikipedia, Clique
FORMULA
a(n) = 6*n+3 for n > 3.
MATHEMATICA
Join[{24}, 6*Range[4, 50]+3] (* Harvey P. Dale, Jan 16 2023 *)
CROSSREFS
Sequence in context: A071833 A064159 A141632 * A141634 A162465 A067193
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Jun 10 2019
STATUS
approved