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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119637 Related to number of reachable pairs in a digraph (see Rao article for details). 1
0, 2, 4, 9, 14, 22, 28, 44, 52, 67, 84, 97, 117, 139, 163, 189, 206, 235, 266, 299, 334, 371, 410, 451, 478, 522, 568, 616, 666, 718, 748, 803, 860, 919, 980, 1043, 1108, 1175, 1244, 1315, 1388, 1463, 1540, 1619, 1700, 1783, 1838, 1924, 2012 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

A. R. Rao, The number of reachable pairs in a digraph, Discr. Math., 306 (2006), 1595-1600.

LINKS

A. R. Rao, Table of n, a(n) for n = 1..200

CROSSREFS

Sequence in context: A059447 A190553 A078671 * A169762 A173407 A113862

Adjacent sequences:  A119634 A119635 A119636 * A119638 A119639 A119640

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jul 27 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.