Discussion
Tue Mar 17
03:02
Michel Marcus: ok then
FORMULA
a(n) = 7*n^2 - 38*n + 49 for n > 4.
Discussion
Mon Mar 16
14:10
Andrew Howroyd: It's just a typical Weisstein typo. He is actually really approachable - and jumps on these things if you send him an email. (could save you some work). [It's easy to fall into the illusion that those that write encyclopedias must be faultless - I actually need to follow up with him on his almost certainly incorrect definition of chordless cycle that is everywhere - compare his with wikipedia's]
15:02
Pontus von Brömssen: Ok, thanks Andrew.
Discussion
Mon Mar 16
08:43
Pontus von Brömssen: There are a lot of sequences named "Number of (not necessarily maximum) cliques ...". I think it should be "maximal" in place of "maximum". The point is that "clique" can have two meanings, either any complete subgraph or a maximal complete subgraph. But I don't think it ever means a necessarily maximum (largest) complete subgraph. See the second paragraph under Definitions in the linked Wikipedia article on cliques. Since this formulation appears in a lot of sequences, I think it would be good to have a second opinion before I start making changes.
Discussion
Mon Mar 16
08:21
Michel Marcus: please add extension : Name corrected by
NAME
Number of (not necessarily minimummaximal) cliques in the n X n fiveleaper graph.
LINKS
Wikipedia, <a href="https://en.wikipedia.org/wiki/Clique_(graph_theory)">Clique</a>