The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A369284 Number of point-determining graphs on n unlabeled nodes with no isolated vertices. 1
 1, 0, 1, 1, 4, 12, 66, 522, 7525, 198389, 9816493, 903092383, 153733197077, 48444061519659, 28363852590188969, 30996574583203962119, 63502062798039684795935, 244852576446682783722245053, 1783161675023082411226026322655, 24603891461799405333437840036319801 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Point-determining graphs are also called mating graphs. See A004110 for references. The inverse Euler transform of this sequence gives A004108 except with a(1) = 0 and a(2) = 1. LINKS Andrew Howroyd, Table of n, a(n) for n = 0..50 FORMULA a(n) = A004110(n) - a(n-1) for n > 0. G.f.: B(x)/(1 + x) where B(x) is the g.f. of A004110. CROSSREFS Cf. A004108, A004110 (point-determining graphs). Sequence in context: A222612 A339134 A000843 * A358409 A180386 A302434 Adjacent sequences: A369281 A369282 A369283 * A369285 A369286 A369287 KEYWORD nonn AUTHOR Andrew Howroyd, Jan 18 2024 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 13 04:25 EDT 2024. Contains 374266 sequences. (Running on oeis4.)