Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119637
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119637 Related to number of reachable pairs in a digraph (see Rao article for details). +0
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; listen)
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: A077224 A059447 A078671 this_sequence A113862 A036277 A042960

Adjacent sequences: A119634 A119635 A119636 this_sequence A119638 A119639 A119640

KEYWORD

nonn

AUTHOR

njas, Jul 27 2006

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research