Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130768
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130768 Number of minimally strongly connected digraphs on n labeled vertices. +0
1
1, 5, 58, 1069, 27816, 943669, 39757264, 2010923289, 119153235520, 8118839891161, 627023347399296, 54258093698028037 (list; graph; listen)
OFFSET

2,2

REFERENCES

Kiran Kumar Bhogadi, Decomposition and Generation of Minimal Strongly Connected Digraphs.

CROSSREFS

Cf. A130756.

Sequence in context: A104099 A129897 A097631 this_sequence A001624 A096476 A015994

Adjacent sequences: A130765 A130766 A130767 this_sequence A130769 A130770 A130771

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Jul 13 2007

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research