id:A035081 - OEIS Search Results

Search: id:A035081

Displaying 1-1 of 1 results found.

page 1

Number of increasing asymmetric rooted connected graphs where every block is a complete graph.

+0
4

1, 1, 1, 7, 27, 167, 1451, 12672, 133356, 1573608, 20731512, 299642958, 4732486932, 81201040470, 1500094187292, 29730606352920, 628968809015766, 14147458062941100, 337143091156288002, 8485143902146640124 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`In an increasing rooted graph nodes are numbered and numbers increase as you move away from root.`
	LINKS	`C. G. Bower, Transforms (2)`
	FORMULA	`Shifts left when EGJ transform applied twice.`
	CROSSREFS	`Cf. A007549, A007561, A035079, A035080.` `Sequence in context: A147996 A034536 A151496 this_sequence A003148 A033910 A152578` `Adjacent sequences: A035078 A035079 A035080 this_sequence A035082 A035083 A035084`
	KEYWORD	`nonn,eigen`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Nov 15 1998.`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research