id:A134799 - OEIS Search Results

Search: id:A134799

Displaying 1-1 of 1 results found.

page 1

a(n)=3^((3^n - 1)/2).

+0
1

1, 3, 81, 1594323, 12157665459056928801 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Number of partitions into "bus routes" of the graph G_{n+1} defined below.`
	LINKS	`Author?, Mitsumata tree`
	EXAMPLE	`.........\|..................G_1` `**` `.......__\|__................G_2` `.........\|` `` `.__\|_____\|_____\|__..........G_3` `...\|.....\|.....\|` `.........\|` `.......__\|__` `.........\|` `.` `..._\|_........._\|_..........G_4` `_\|__\|_____\|_____\|__\|_` `.\|._\|_....\|...._\|_.\|` `....\|.....\|.....\|` `......_\|__\|__\|_` `.......\|._\|_.\|` `..........\|` `**` `G_1 = o---. = rooted tree with one edge and one leaf node. For n > 0, G_{n+1} is obtained from G_n by splitting each leaf node into three.`
	CROSSREFS	`Cf. A131709` `Sequence in context: A116179 A013732 A060722 this_sequence A055590 A037111 A067202` `Adjacent sequences: A134796 A134797 A134798 this_sequence A134800 A134801 A134802`
	KEYWORD	`nonn,easy`
	AUTHOR	`Yasutoshi Kohmoto (zbi74583(AT)boat.zero.ad.jp), Jan 09 2008`
	EXTENSIONS	`Edited by njas, Jan 29 2008`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.