|
|
|
|
#15 by Joerg Arndt at Wed Dec 21 04:47:57 EST 2022
|
|
|
|
#14 by Georg Fischer at Wed Dec 21 01:28:23 EST 2022
|
|
|
Discussion
|
Wed Dec 21
| 01:34
| Michel Marcus: but A241841 has only 19 terms ?
|
| 03:25
| Georg Fischer: I put b241841.txt with 40 terms also.
|
|
|
|
#13 by Georg Fischer at Wed Dec 21 01:28:00 EST 2022
|
| LINKS
|
Georg Fischer, <a href="/A306003/b306003.txt">Table of n, a(n) for n = 1..40</a>
|
| STATUS
|
proposed
editing
|
|
|
|
#12 by Michel Marcus at Wed Dec 21 01:04:43 EST 2022
|
|
|
Discussion
|
Wed Dec 21
| 01:07
| Georg Fischer: Yes.
|
|
|
|
#11 by Michel Marcus at Wed Dec 21 01:01:21 EST 2022
|
| EXAMPLE
|
a(7) = 846 counts A241841(7)=) = 842 graphs with one component plus 4 graphs with two components (the two components being the connected graph on 3 nodes and any of the 4 graphs on 4 nodes).
a(9) = 261212 counts A241841(9) = 261033 graphs with one component, 178 graphs with two components, and 1 graph with 3 components.
|
|
|
Discussion
|
Wed Dec 21
| 01:04
| Michel Marcus: you did the Euler transform ?
|
|
|
|
#10 by Michel Marcus at Wed Dec 21 01:00:43 EST 2022
|
| EXAMPLE
|
a(7)=) = 846 counts A241841(7)=842 graphs with one component plus 4 graphs with two components (the two components being the connected graph on 3 nodes and any of the 4 graphs on 4 nodes).
|
| STATUS
|
proposed
editing
|
|
|
|
#9 by Georg Fischer at Tue Dec 20 15:49:10 EST 2022
|
|
|
|
#8 by Georg Fischer at Tue Dec 20 15:48:59 EST 2022
|
| DATA
|
0, 0, 1, 4, 18, 107, 846, 11122, 261212, 11717906, 1006716728, 164060156360, 50335920919080, 29003488522658695, 31397381311096116107, 63969560164236980493127, 245871831711291931225960094, 1787331725280413408599670721723, 246360214294639633325622155799065224636021429463963332562215579906526
|
| EXTENSIONS
|
a(19) corrected by Georg Fischer, Dec 20 2022
|
| STATUS
|
approved
editing
|
|
|
|
#7 by R. J. Mathar at Sat Jun 16 14:51:32 EDT 2018
|
|
|
|
#6 by R. J. Mathar at Sat Jun 16 14:46:38 EDT 2018
|
| CROSSREFS
|
Cf. A241841 (connected variant), A306004.A286743 (at least one component has one cycle).
|
| STATUS
|
proposed
editing
|
|
|
|