login

Revision History for A000088

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Number of simple graphs on n unlabeled nodes.
(history; published version)
#360 by Michael De Vlieger at Sun Oct 27 12:12:37 EDT 2024
STATUS

reviewed

approved

#359 by Joerg Arndt at Sun Oct 27 11:47:59 EDT 2024
STATUS

proposed

reviewed

#358 by Michael De Vlieger at Sun Oct 27 10:48:25 EDT 2024
STATUS

editing

proposed

#357 by Michael De Vlieger at Sun Oct 27 10:48:22 EDT 2024
LINKS

Angelo Monti and Blerina Sinaimeri, <a href="https://arxiv.org/abs/2410.16023">Effects of graph operations on star pairwise compatibility graphs</a>, arXiv:2410.16023 [cs.DM], 2024. See p. 16.

STATUS

approved

editing

#356 by Alois P. Heinz at Thu Sep 12 11:37:20 EDT 2024
STATUS

proposed

approved

#355 by Tristan Figueroa-Reid at Wed Sep 11 22:09:07 EDT 2024
STATUS

editing

proposed

Discussion
Wed Sep 11
23:31
Michel Marcus: then I think should add extension Name clarified by
Thu Sep 12
11:36
Alois P. Heinz: ...
#354 by Tristan Figueroa-Reid at Wed Sep 11 22:08:31 EDT 2024
NAME

Number of simple graphs on n unlabeled nodes.

STATUS

approved

editing

Discussion
Wed Sep 11
22:09
Tristan Figueroa-Reid: Mention that these graphs are simple - to go well with the naming used in A005470 (though I would use the exact format defined in A005470 without the use of 'planar').
#353 by Alois P. Heinz at Tue Jul 02 14:50:22 EDT 2024
STATUS

proposed

approved

#352 by Chai Wah Wu at Tue Jul 02 14:32:58 EDT 2024
STATUS

editing

proposed

#351 by Chai Wah Wu at Tue Jul 02 14:32:46 EDT 2024
PROG

from math import prod, factorial, gcd, comb

def A000088(n): return int(sum(Fraction(1<<sum(p[r]*p[s]*gcd(r, s) for r, s in combinations(p.keys(), 2))+sum((q>>1)*r+(q*combr*(r, 2-1)>>1) for q, r in p.items()), prod(q**r*factorial(r) for q, r in p.items())) for p in partitions(n))) # Chai Wah Wu, Jul 02 2024

STATUS

proposed

editing