A029835 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A029835

[ log(n-th prime) ].

0, 1, 1, 1, 2, 2, 2, 2, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,5

LINKS

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

MATHEMATICA

Table[Floor[Log[Prime[n]]], {n, 80}] (* Alonso del Arte, Sep 11 2013 *)

PROG

(PARI) a(n) = floor(log(prime(n))); \\ Michel Marcus, Sep 11 2013

CROSSREFS

Sequence in context: A347966 A186437 A345376 * A074280 A000523 A124156

Adjacent sequences: A029832 A029833 A029834 * A029836 A029837 A029838

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved