请输入您要查询的字词:

 

单词 WedderburnEtheringtonNumber
释义

Wedderburn-Etherington number


The nth Wedderburn-Etherington numberMathworldPlanetmath counts how many weakly binary trees can be constructed such that each graph vertex (not counting the root vertex) is adjacent to no more than three other such vertices, for a given number n of nodes. The first few Wedderburn-Etherington numbers are 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, etc. listed in A001190 of Sloane’s OEIS. Michael Somos gives the following recurrence relations:

a2n=12anan+1+i=1naia2n-i

and

a2n-1=i=0n-1ai+1a2n-i

with a1=a2=1 in both relationsMathworldPlanetmath.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/5 4:53:34