login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003318 a(n + 1) = 1 + a([ n/1 ]) + a([ n/2 ]) + ... + a([ n/n ]).
(Formerly M1052)
1
1, 2, 4, 7, 12, 18, 28, 39, 55, 74, 100, 127, 167, 208, 261, 322, 399, 477, 581, 686, 820, 967, 1142, 1318, 1545, 1778, 2053, 2347, 2697, 3048, 3486, 3925, 4441, 4986, 5610 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

Goldberg, M. K.; Livshits, E. M.; Minimal universal trees. (Russian) Mat. Zametki 4 1968 371-379.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. C. Read, personal communication.

CROSSREFS

Cf. A003238.

Sequence in context: A175812 A002621 A033500 * A035300 A035296 A105807

Adjacent sequences:  A003315 A003316 A003317 * A003319 A003320 A003321

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.