A062590 - OEIS

This site is supported by donations to The OEIS Foundation.

A062590

Variation on A029834: a discrete version of the Mangoldt function. If n is prime then floor(log(prime(n)) else 0.

0, 1, 1, 0, 2, 0, 2, 0, 0, 0, 3, 0, 3, 0, 0, 0, 4, 0, 4, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 5, 0, 0, 0, 5, 0, 5, 0, 0, 0, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 5, 0, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 5, 0, 5, 0, 0, 0, 0, 0, 5, 0, 0, 0, 6, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 6, 0, 6, 0, 0 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,5`
	PROG	`(PARI) v=[]; for(n=1, 150, v=concat(v, if(isprime(n), floor(log(prime(n))), ))); v`
	CROSSREFS	`Cf. A029834.` `Sequence in context: A202385 A029833 A050948 * A139215 A139216 A092078` `Adjacent sequences: A062587 A062588 A062589 * A062591 A062592 A062593`
	KEYWORD	`nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), Jul 03 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 05:55 EST 2012. Contains 205860 sequences.