Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119640
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119640 Related to number of reachable pairs in a digraph (see Rao article for details). +0
1
0, 1, 4, 9, 12, 20, 30, 42, 56, 72, 90, 99, 120, 143, 168, 195, 224, 255, 288, 323, 360, 378, 418, 460, 504, 550, 598, 648, 700, 754, 810, 868, 928, 990, 1054, 1085, 1152, 1221, 1292, 1365, 1440, 1517, 1596, 1677, 1760, 1845, 1932, 2021, 2112 (list; graph; listen)
OFFSET

1,3

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: A067259 A060687 A084789 this_sequence A051233 A124623 A069082

Adjacent sequences: A119637 A119638 A119639 this_sequence A119641 A119642 A119643

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


AT&T Labs Research