login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A000195
a(n) = floor(log(n)).
24
0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
OFFSET
1,8
COMMENTS
Equals A004233(n) - 1 for n > 1.
Does not satisfy Benford's law [Whyman et al., 2016] - N. J. A. Sloane, Feb 12 2017
LINKS
G. Whyman, N. Ohtori, E. Shulzinger, and Ed. Bormashenko, Revisiting the Benford law: When the Benford-like distribution of leading digits in sets of numerical data is expectable?, Physica A: Statistical Mechanics and its Applications, 461, 595-601 (2016).
FORMULA
Conjecture: a(n) = floor(3*n^2*(n^(1/(3*n^2))-1)), checked for n <= 10^6. - Joseph M. Shunia, Aug 02 2024
MAPLE
Digits := 100; f := n->floor(evalf(log(n))); [ seq(f(n), n=1..100) ];
MATHEMATICA
Floor@ Log@ Range@ 105 (* Michael De Vlieger, Aug 21 2017 *)
PROG
(PARI) a(n)=floor(log(n))
(Haskell)
a000195 = floor . log . fromIntegral -- Reinhard Zumkeller, Mar 17 2015
CROSSREFS
Cf. A000193 (nearest integer to log(n)), A004233.
Cf. A000523.
Sequence in context: A137325 A180258 A211663 * A135663 A090620 A151659
KEYWORD
nonn,easy
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy