login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2017 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

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

Andrew Howroyd, Table of n, a(n) for n = 1..50

V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.

FORMULA

a(n) = 2*A054919(n) - A000595(n).

CROSSREFS

Cf. A000595, A054919.

Sequence in context: A018364 A100603 A301818 * A062061 A066974 A270583

Adjacent sequences:  A054917 A054918 A054919 * A054921 A054922 A054923

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 10 05:49 EST 2018. Contains 318044 sequences. (Running on oeis4.)