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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004233 a(n) = ceiling(log(n)). 6
0, 1, 2, 2, 2, 2, 2, 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, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

Does not satisfy Benford's law [Whyman et al., 2016]. - N. J. A. Sloane, Feb 12 2017

LINKS

T. D. Noe, Table of n, a(n) for n = 1..10000

G. Whyman, N. Ohtori, E. Shulzinger, 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 (2016), 595-601.

Index entries for sequences related to Benford's law

PROG

(Haskell)

a004233 = ceiling . log . fromIntegral  -- Reinhard Zumkeller, Mar 17 2015

(PARI) a(n)=ceil(log(n)) \\ Charles R Greathouse IV, Apr 29 2015

CROSSREFS

Cf. A000193, A000195, A000523.

Sequence in context: A125269 A077430 A105513 * A130259 A068549 A132173

Adjacent sequences:  A004230 A004231 A004232 * A004234 A004235 A004236

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

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 July 5 00:40 EDT 2020. Contains 335457 sequences. (Running on oeis4.)