The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A352765 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of asymmetric n-node graphs with the smallest number (A352764(n)) of edges.
(history; published version)

#5 by N. J. A. Sloane at Sat Apr 16 05:48:25 EDT 2022

STATUS

proposed

approved

#4 by Pontus von Brömssen at Sun Apr 03 08:34:12 EDT 2022

STATUS

editing

proposed

#3 by Pontus von Brömssen at Sun Apr 03 08:27:45 EDT 2022

KEYWORD

nonn,more,changed

#2 by Pontus von Brömssen at Sat Apr 02 08:53:45 EDT 2022

NAME

allocated for Pontus von BrömssenNumber of asymmetric n-node graphs with the smallest number (A352764(n)) of edges.

DATA

1, 0, 0, 0, 0, 1, 2, 1, 1, 3, 6, 15, 29, 68, 144, 1, 3, 9, 24, 62

OFFSET

1,7

CROSSREFS

KEYWORD

allocated

nonn

AUTHOR

STATUS

approved

editing

#1 by Pontus von Brömssen at Sat Apr 02 01:24:21 EDT 2022

NAME

allocated for Pontus von Brömssen

KEYWORD

allocated

STATUS

approved