[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a091241 -id:a091241
     Sort: relevance | references | number | modified | created      Format: long | short | data
(Largest Matula-Goebel number encoding a tree with n nodes) - (smallest Matula-Goebel number encoding a tree with n nodes).
+10
6
1, 1, 2, 4, 11, 53, 307, 2177, 19503, 219489, 3041937, 50727755, 997525229, 22742733167, 592821131015, 17461204518199
OFFSET
1,3
REFERENCES
F. Goebel, On a 1-1-correspondence between rooted trees and natural numbers, J. Combin. Theory, B 29 (1980), 141-143.
D. Matula, A natural rooted tree enumeration by prime factorization, SIAM Rev. 10 (1968).
FORMULA
a(n) = (A005518(n)-A005517(n))+1.
CROSSREFS
Compare to A091241 and A000081. Cf. A061773.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 03 2004
STATUS
approved
Number of nodes in rooted tree with GF2X-Matula number n.
+10
6
1, 2, 3, 3, 5, 4, 4, 4, 6, 6, 4, 5, 6, 5, 7, 5, 9, 7, 5, 7, 7, 5, 8, 6, 5, 7, 8, 6, 6, 8, 5, 6, 7, 10, 9, 8, 7, 6, 8, 8, 7, 8, 7, 6, 10, 9, 5, 7, 7, 6, 11, 8, 7, 9, 6, 7, 10, 7, 7, 9, 6, 6, 9, 7, 11, 8, 8, 11, 7, 10, 8, 9, 6, 8, 12, 7, 9, 9, 8, 9, 11, 8, 9, 9, 13, 8, 10, 7, 8, 11, 8, 10, 8, 6, 9, 8
OFFSET
1,2
COMMENTS
Each n occurs A000081(n) times.
EXAMPLE
GF2X-Matula numbers for unoriented rooted trees are constructed otherwise just like the standard Matula-Goebel numbers (cf. A061773), but instead of normal factorization in N, one factorizes in polynomial ring GF(2)[X] as follows. Here IR(n) is the n-th irreducible polynomial (A014580(n)) and X stands for GF(2)[X]-multiplication (A048720):
................................................o...................o
................................................|...................|
............o...............o...o........o......o...............o...o
............|...............|...|........|......|...............|...|
...o........o......o...o....o...o....o...o......o......o.o.o....o...o
...|........|.......\./......\./......\./.......|.......\|/......\./.
x..x........x........x........x........x........x........x........x..
1..2 = IR(1)..3 = IR(2)..4 = 2 X 2....5 = 3 X 3....6 = 2 X 3....7 = IR(3)..8 = 2 X 2 X 2..9 = 3 X 7
Counting the vertices (marked with x's and o's) of each tree above, we get the eight initial terms of this sequence: 1,2,3,3,5,4,4,4,6.
CROSSREFS
a(n) = A061775(A091205(n)). a(A091230(n)) = n+1. Cf. A091239-A091241.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 03 2004
STATUS
approved
Smallest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.
+10
3
1, 2, 3, 6, 5, 9, 15, 23, 17, 34, 51, 75, 85, 153, 255, 359, 257, 514, 771, 1275, 1285, 2313, 3855, 5911, 4369, 8738, 13107, 19275, 21845, 39321, 65535
OFFSET
1,2
CROSSREFS
Analogous to A005517. A091240 gives the largest i with number of nodes = n. Cf. A091238, A091241.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 03 2004
STATUS
approved
Largest GF2X-Matula number i which encodes a tree of n nodes, i.e., for which A091238(i) = n.
+10
2
1, 2, 4, 11, 47, 319, 3053, 40345
OFFSET
1,2
COMMENTS
Apparently from n=4 onward given by recurrence a(4) = A014580(4), a(5) = A014580(A014580(4)), a(6) = A014580(A014580(A014580(4))), etc.
CROSSREFS
Analogous to A005518. A091239 gives the smallest i with number of nodes = n. Cf. A091230, A091238, A091241.
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 03 2004
STATUS
approved

Search completed in 0.056 seconds