login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A119639
Related to number of reachable pairs in a digraph (see Rao article for details).
1
1, 3, 6, 11, 17, 25, 34, 47, 59, 74, 91, 109, 129, 152, 176, 202, 229, 259, 290, 323, 358, 396, 435, 476, 518, 562, 609, 657, 707, 759, 812, 869, 927, 987, 1048, 1111, 1176, 1244, 1313, 1384, 1457, 1532, 1609, 1689, 1770, 1853, 1937, 2023, 2111
OFFSET
1,2
LINKS
A. R. Rao, The number of reachable pairs in a digraph, Discr. Math., 306 (2006), 1595-1600.
CROSSREFS
Sequence in context: A176708 A273140 A320272 * A281376 A247586 A377407
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 27 2006
STATUS
approved