|
|
A007187
|
|
Leech's tree-labeling problem for n nodes.
(Formerly M2532)
|
|
1
|
|
|
|
OFFSET
|
2,2
|
|
COMMENTS
|
a(11) >= 48, a(12) >= 55.
a(n) is the greatest number k such that there exists a tree with n nodes and integral edge labels such that for each integer 1 <= m <= k, there exists a pair of nodes such that the sum of the edge labels on the path connecting the two nodes equals m. - Charlie Neder, Apr 26 2019
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, Sect. C10.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,nice,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|