The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A367863

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A367863

Number of n-vertex labeled simple graphs with n edges and no isolated vertices.
(history; published version)

#17 by OEIS Server at Fri Dec 29 16:41:09 EST 2023

LINKS

Andrew Howroyd, <a href="/A367863/b367863_1.txt">Table of n, a(n) for n = 0..200</a>

#16 by Michael De Vlieger at Fri Dec 29 16:41:09 EST 2023

STATUS

proposed

approved

Discussion

Fri Dec 29

16:41

OEIS Server: Installed first b-file as b367863.txt.

#15 by Andrew Howroyd at Fri Dec 29 15:23:40 EST 2023

STATUS

editing

proposed

#14 by Andrew Howroyd at Fri Dec 29 15:22:54 EST 2023

EXTENSIONS

Terms a(8) and beyond from Andrew Howroyd, Dec 29 2023

STATUS

proposed

editing

#13 by Andrew Howroyd at Fri Dec 29 15:21:37 EST 2023

STATUS

editing

proposed

#12 by Andrew Howroyd at Fri Dec 29 14:47:20 EST 2023

DATA

1, 0, 0, 1, 15, 222, 3760, 73755, 1657845, 42143500, 1197163134, 37613828070, 1295741321875, 48577055308320, 1969293264235635, 85852853154670693, 4005625283891276535, 199166987259400191480, 10513996906985414443720, 587316057411626070658200, 34612299496604684775762261

#11 by Andrew Howroyd at Fri Dec 29 14:46:18 EST 2023

LINKS

Andrew Howroyd, <a href="/A367863/b367863_1.txt">Table of n, a(n) for n = 0..200</a>

FORMULA

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * binomial(binomial(k,2), n). - Andrew Howroyd, Dec 29 2023

PROG

(PARI) a(n) = sum(k=0, n, (-1)^(n-k) * binomial(n, k) * binomial(binomial(k, 2), n)) \\ Andrew Howroyd, Dec 29 2023

KEYWORD

nonn,more,changed

STATUS

approved

editing

#10 by Michael De Vlieger at Thu Dec 28 09:22:20 EST 2023

STATUS

proposed

approved

#9 by Gus Wiseman at Thu Dec 28 08:52:46 EST 2023

STATUS

editing

proposed

#8 by Gus Wiseman at Thu Dec 28 06:10:00 EST 2023

FORMULA

Binomial transform is A367862.

STATUS

approved

editing