Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054920
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054920 Number of connected unlabeled reflexive relations with n nodes such that complement is also connected. +0
1
2, 4, 68, 2592, 278796, 95720106, 111891292036, 457846756500066, 6664787020904248568, 349363873490889302878250, 66602024342830108271942323060, 46557190064705399729526041154647820 (list; graph; listen)
OFFSET

1,1

LINKS

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

FORMULA

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

CROSSREFS

Sequence in context: A118993 A100603 A018364 this_sequence A062061 A066974 A018373

Adjacent sequences: A054917 A054918 A054919 this_sequence A054921 A054922 A054923

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 17 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research