id:A062590 - OEIS Search Results

Search: id:A062590

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

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

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.

AT&T Labs Research