Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054921
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054921 Number of connected unlabeled symmetric relations (graphs with loops) having n nodes. +0
2
2, 3, 10, 50, 354, 3883, 67994, 2038236, 109141344, 10693855251, 1934271527050, 648399961915988, 404093642681273382, 469756524755173254759, 1022121472711196824292810, 4176802133456105622904206409 (list; graph; listen)
OFFSET

1,1

LINKS

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

FORMULA

EULERi transform of A000666.

CROSSREFS

Sequence in context: A020116 A020098 A013081 this_sequence A052561 A066526 A093856

Adjacent sequences: A054918 A054919 A054920 this_sequence A054922 A054923 A054924

KEYWORD

nonn,easy

AUTHOR

njas, May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research