Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007187
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007187 Leech's tree-labeling problem for n nodes.
(Formerly M2532)
+0
2
1, 3, 6, 9, 15, 20, 26, 34, 41 (list; graph; listen)
OFFSET

2,2

REFERENCES

R. K. Guy, A quarter century of "Monthly" unsolved problems, 1969-1993, Amer Math. Monthly, 100 (1993), 945-949.

R. K. Guy, Unsolved Problems in Number Theory, Sect. C10.

J. Leech, On the representation of $1,2,\cdots,n$ by differences. J. London Math. Soc. 31 (1956), 160-169.

LINKS

Index entries for sequences related to trees

CROSSREFS

Cf. A005488.

Sequence in context: A133205 A049991 A031940 this_sequence A082004 A112773 A070885

Adjacent sequences: A007184 A007185 A007186 this_sequence A007188 A007189 A007190

KEYWORD

nonn,hard,nice

AUTHOR

njas

EXTENSIONS

a(11)>=48, a(12)>=55.

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research