id:A136722 - OEIS Search Results

Search: id:A136722

Displaying 1-1 of 1 results found.

page 1

Number of preferential arrangements (or hierarchical orderings) on the connected graphs on n unlabeled nodes.

+0
3

1, 1, 2, 8, 48, 336, 3584, 54592, 1422976, 66836480, 5998884352, 1030861378560, 335994532814848, 206175878632321024, 237596569295651315712, 514414692643000188272640 (list; graph; listen)

	OFFSET	`0,3`
	LINKS	`Thomas Wieder, HomePage.` `Thomas Wieder, (Old) HomePage.`
	FORMULA	`a(n)=A001349(n)*A011782(n).`
	EXAMPLE	`There are A001349(3)=2 connected graphs for n=3 unlabeled elements:` `The chain` `o-o-o` `and the triangle` `. o` `/..\` `o - o.` `There are a(3)=8 hierarchical orders on these two graphs.` `The chain gives us 6 orderings:` `o-o-o` `o` `\|` `o-o` `. o` `/..\` `o . o` `o . o` `.\./` `. o` `o-o` `\|` `o` `o` `\|` `o` `\|` `o` `The triangle gives us two orderings:` `. o` `/..\` `o - o` `o - o` `\../` `. o`
	CROSSREFS	`Cf. A001349, A011782, A136723, A034691, A075729.` `Sequence in context: A104190 A152661 A007170 this_sequence A085615 A054726 A003576` `Adjacent sequences: A136719 A136720 A136721 this_sequence A136723 A136724 A136725`
	KEYWORD	`easy,nonn`
	AUTHOR	`Thomas Wieder (thomas.wieder(AT)t-online.de), Jan 19 2008`

page 1

Search completed in 0.003 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.

AT&T Labs Research