id:A024358 - OEIS Search Results

Search: id:A024358

Displaying 1-1 of 1 results found.

page 1

Sum of the sizes of binary subtrees of the perfect binary tree of height n.

+0
1

1, 1, 8, 105, 6136, 8766473, 8245941529080, 3508518207951157937469961, 311594265746788494170062926869662848646207622648, 12173084912399068293929880081439496473989436171886601861305455029130552173440254\ 10733271773705 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Size of binary tree = number of internal nodes.`
	LINKS	`C. Banderier, On the sum of the sizes of binary subtrees of a perfect binary tree, preprint, 2000`
	FORMULA	`a(n) = B'_n(1) where B_{n+1}(x)=1+xB_n(x)^2.`
	CROSSREFS	`Cf. A003095.` `Sequence in context: A001922 A113551 A082735 this_sequence A055406 A155632 A129278` `Adjacent sequences: A024355 A024356 A024357 this_sequence A024359 A024360 A024361`
	KEYWORD	`easy,nonn`
	AUTHOR	`Cyril Banderier (Cyril.Banderier(AT)inria.fr), Jun 09 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research