The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054920 Number of connected unlabeled reflexive relations with n nodes such that complement is also connected. 1
2, 4, 68, 2592, 278796, 95720106, 111891292036, 457846756500066, 6664787020904248568, 349363873490889302878250, 66602024342830108271942323060, 46557190064705399729526041154647820 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
FORMULA
a(n) = 2*A054919(n) - A000595(n).
MATHEMATICA
A000595 = Import["https://oeis.org/A000595/b000595.txt", "Table"][[All, 2]];
(* EulerInvTransform is defined in A022562 *)
A054919 = Join[{1}, EulerInvTransform[A000595 // Rest]];
a[n_] := 2 A054919[[n + 1]] - A000595[[n + 1]];
Array[a, 50] (* Jean-François Alcover, Sep 01 2019, updated Mar 17 2020 *)
CROSSREFS
Sequence in context: A100603 A362456 A301818 * A062061 A066974 A270583
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 24 2000
EXTENSIONS
More terms from Vladeta Jovovic, Jul 17 2000
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 2 00:37 EDT 2024. Contains 373032 sequences. (Running on oeis4.)