Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A144964
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A144964 Number of groves of degree n. +0
1
1, 3, 31, 16383, 4398046511103, 5444517870735015415413993718908291383295 (list; graph; listen)
OFFSET

1,2

COMMENT

Let Y_n be the set of trees of degree n. A nonempty subset of Y_n is called a

grove. The set of all groves of degree n is denoted by Y_n.

a(n) for n<= 7 given by right-most column of Table 1,

p.3, of Bruno and Yasaki: The arithmetic of the natural numbers N can be extended

to arithmetic operations on planar binary trees. This gives rise to a

non-commutative arithmetic theory. In this exposition, we describe this

arithmetree, first defined by Loday and investigate prime trees.

REFERENCES

J.-L. Loday, Arithmetree, J. Algebra 258 (2002), no. 1, 275-309, Special issue in celebration of Claudio Procesi's 60th birthday.

LINKS

Adriano Bruno, Dan Yasaki, The arithmetic of trees, Sep 25, 2008.

CROSSREFS

Cf. A000108.

Sequence in context: A129209 A134721 A002707 this_sequence A118913 A005042 A136582

Adjacent sequences: A144961 A144962 A144963 this_sequence A144965 A144966 A144967

KEYWORD

nonn

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Sep 27 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research