Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003318
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003318 a(n + 1) = 1 + a([ n/1 ]) + a([ n/2 ]) + ... + a([ n/n ]).
(Formerly M1052)
+0
2
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; listen)
OFFSET

1,2

REFERENCES

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

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

R. C. Read, personal communication.

CROSSREFS

Cf. A003238.

Sequence in context: A049703 A002621 A033500 this_sequence A035300 A035296 A105807

Adjacent sequences: A003315 A003316 A003317 this_sequence A003319 A003320 A003321

KEYWORD

nonn

AUTHOR

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

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research