About: Wedderburn–Etherington number     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Series108457976, within Data Space : dbpedia.org associated with source document(s)
QRcode icon
http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FWedderburn%E2%80%93Etherington_number

The Wedderburn–Etherington numbers are an integer sequence named for Ivor Malcolm Haddon Etherington and Joseph Wedderburn that can be used to count certain kinds of binary trees. The first few numbers in the sequence are 0, 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, ... (OEIS: )

AttributesValues
rdf:type
rdfs:label
  • Nombre de Wedderburn-Etherington (fr)
  • Numero di Wedderburn-Etherington (it)
  • Wedderburn–Etherington number (en)
  • 韦德伯恩-埃瑟林顿数 (zh)
rdfs:comment
  • En théorie des graphes, le n-ième nombre de Wedderburn-Etherington est le nombre d'arbres binaires à n nœuds dont aucune arête n'est adjacente à plus de trois autres (on ne considère pas les arêtes racines). Ces nombres ont reçu le nom des mathématiciens (en) (1908-1994) et Joseph Wedderburn (1882-1948). Ils forment la suite d'entiers   de l'OEIS : 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, etc. * Portail des mathématiques * Portail de l'informatique théorique (fr)
  • The Wedderburn–Etherington numbers are an integer sequence named for Ivor Malcolm Haddon Etherington and Joseph Wedderburn that can be used to count certain kinds of binary trees. The first few numbers in the sequence are 0, 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, ... (OEIS: ) (en)
  • 在图论中，韦德伯恩-埃瑟林顿数是由计算每张图有多少弱二叉树问题而得出的數列。 最初的几个韦德伯恩-埃瑟林顿数为：1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, 127912, 293547, 676157, 1563372, 3626149, 8436379, 19680277, 46026618, 107890609, 253450711, 596572387, 1406818759, 3323236238, 7862958391,... （OEIS數列） (zh)
  • In teoria dei grafi, un numero di Wedderburn-Etherington è il numero di distinti alberi binari che possono essere costruiti con una data quantità di nodi, cioè il numero di grafi nei quali ogni vertice è collegato con uno o tre altri vertici. Il loro nome deriva dai matematici e Joseph Wedderburn. I primi numeri di Wedderburn-Etherington sono: 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, 127912, 293547, 676157, 1563372, 3626149, 8436379, 19680277, 46026618, 107890609, 253450711, 596572387, 1406818759, 3323236238, 7862958391. (it)
foaf:depiction
  • http://commons.wikimedia.org/wiki/Special:FilePath/Wedderburn-Etherington_trees.svg
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
thumbnail
has abstract
  • En théorie des graphes, le n-ième nombre de Wedderburn-Etherington est le nombre d'arbres binaires à n nœuds dont aucune arête n'est adjacente à plus de trois autres (on ne considère pas les arêtes racines). Ces nombres ont reçu le nom des mathématiciens (en) (1908-1994) et Joseph Wedderburn (1882-1948). Ils forment la suite d'entiers   de l'OEIS : 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, etc. * Portail des mathématiques * Portail de l'informatique théorique (fr)
  • In teoria dei grafi, un numero di Wedderburn-Etherington è il numero di distinti alberi binari che possono essere costruiti con una data quantità di nodi, cioè il numero di grafi nei quali ogni vertice è collegato con uno o tre altri vertici. Il loro nome deriva dai matematici e Joseph Wedderburn. I primi numeri di Wedderburn-Etherington sono: 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, 127912, 293547, 676157, 1563372, 3626149, 8436379, 19680277, 46026618, 107890609, 253450711, 596572387, 1406818759, 3323236238, 7862958391. I numeri di Wedderburn-Etherington hanno un ruolo anche in tassonomia cladistica, rappresentando il numero di possibili alberi evolutivi per un dato numero di specie, inclusi i punti di speciazione. (it)
  • The Wedderburn–Etherington numbers are an integer sequence named for Ivor Malcolm Haddon Etherington and Joseph Wedderburn that can be used to count certain kinds of binary trees. The first few numbers in the sequence are 0, 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, ... (OEIS: ) (en)
  • 在图论中，韦德伯恩-埃瑟林顿数是由计算每张图有多少弱二叉树问题而得出的數列。 最初的几个韦德伯恩-埃瑟林顿数为：1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, 24631, 56011, 127912, 293547, 676157, 1563372, 3626149, 8436379, 19680277, 46026618, 107890609, 253450711, 596572387, 1406818759, 3323236238, 7862958391,... （OEIS數列） (zh)
prov:wasDerivedFrom
page length (characters) of wiki page
foaf:isPrimaryTopicOf
is Link from a Wikipage to another Wikipage of
is Wikipage redirect of
is Wikipage disambiguates of
is foaf:primaryTopic of
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software