id:A029832 - OEIS Search Results

Search: id:A029832

Displaying 1-1 of 1 results found.

page 1

A discrete version of the Mangoldt function: if n is prime then ceiling(log(n)) else 0.

+0
4

0, 1, 2, 0, 2, 0, 2, 0, 0, 0, 3, 0, 3, 0, 0, 0, 3, 0, 3, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 0, 4, 0, 0, 0, 0, 0, 4, 0, 0, 0, 4, 0, 4, 0, 0, 0, 4, 0, 0, 0, 0, 0, 4, 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 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`The real Mangoldt function Lambda(n) is equal to log(n) if n is prime else 0.`
	REFERENCES	`T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 32.` `P. Ribenboim, Algebraic Numbers, p. 44.`
	CROSSREFS	`Cf. A029833, A029834, A053821.` `Sequence in context: A039970 A105118 A103271 this_sequence A026611 A096972 A101227` `Adjacent sequences: A029829 A029830 A029831 this_sequence A029833 A029834 A029835`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research