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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059921 a(n) = floor(n^((n+1)/n)). 3
1, 2, 4, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Infinitely many integers are missing, starting 3, 7, 18, 50, 140; their ratios tend to e. [Charles R Greathouse IV, Aug 21 2011]

LINKS

Harry J. Smith, Table of n, a(n) for n=1..1000

PROG

(PARI) { for (n=1, 1000, write("b059921.txt", n, " ", floor(n^((n + 1)/n))); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 30 2009]

CROSSREFS

Sequence in context: A133398 A138836 A175431 * A062289 A172284 A039242

Adjacent sequences:  A059918 A059919 A059920 * A059922 A059923 A059924

KEYWORD

easy,nonn

AUTHOR

Fabian Rothelius (fabian.rothelius(AT)telia.com), Feb 09 2001

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 14 07:57 EST 2012. Contains 205602 sequences.