Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126067
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126067 Triangle read by rows: T(n,k) = number of self-converse digraphs with n nodes and k arcs, k=0..n*(n-1). +0
1
1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 3, 5, 9, 10, 12, 10, 9, 5, 3, 1, 1, 1, 1, 3, 6, 15, 24, 41, 57, 77, 84, 90, 84, 77, 57, 41, 24, 15, 6, 3, 1, 1 (list; graph; listen)
OFFSET

1,7

EXAMPLE

1; 1,1,1; 1,1,2,2,2,1,1; 1,1,3,5,9,10,12,10,9,5,3,1,1; ....

CROSSREFS

Cf. A052283, A002499(row sums).

Sequence in context: A047971 A029432 A073426 this_sequence A048858 A135265 A076490

Adjacent sequences: A126064 A126065 A126066 this_sequence A126068 A126069 A126070

KEYWORD

more,nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)Eunet.yu), Feb 28 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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research