login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080021 log(n) is closer to an integer than is log(m) for any m with 2<=m<n. 4
2, 3, 7, 20, 148, 403, 1096, 1097, 2980, 2981, 8103, 59874, 162755, 442413, 1202604, 3269017, 8886110, 8886111, 24154952, 24154953, 65659969, 178482301, 3584912846, 9744803446, 26489122130, 72004899337, 195729609428 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Every term is floor(e^k)+r for some integers k and r with k>=1 and -1 <= r <= 1.

REFERENCES

Suggested by Leroy Quet, Jan 19 2003

LINKS

Table of n, a(n) for n=1..27.

EXAMPLE

log(2) = 1-0.306..., log(3) = 1+0.0986..., log(7) = 2-0.0540..., log(20) = 3-0.00426...

PROG

(PARI) lista(nn) = {flmin = 1; for (i=2, nn, li = log(i); fli = abs(round(li) - li); if (fli < flmin, print1(i, ", "); flmin = fli; ); ); } \\ Michel Marcus, Aug 29 2013

CROSSREFS

Cf. A080022, A080023.

Sequence in context: A222776 A222890 A011968 * A306666 A032313 A032223

Adjacent sequences:  A080018 A080019 A080020 * A080022 A080023 A080024

KEYWORD

nonn

AUTHOR

Dean Hickerson, Jan 20 2003

EXTENSIONS

More terms from Don Reble, Jan 20 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 06:28 EST 2021. Contains 349419 sequences. (Running on oeis4.)