A131483 - OEIS

This site is supported by donations to The OEIS Foundation.

A131483

Meissel_Lehmer recursion: a(n,m) = a(n,m-1)-a(Floor[n/Prime[m]],m-1).

1, 0, -1, 0, -1, -1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1 (list; table; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	REFERENCES	`J. C. Lagarias, V. S. Miller and A. M. Odlyzko, Computing pi(x): The Meissel-Lehmer method, Math. Comp., 44 (1985), pp. 537-560.`
	FORMULA	`a(1,1)=1; a(n,m) =a(n,m-1)-a(Floor[n/Prime[m]],m-1);`
	EXAMPLE	`{1},` `{0, -1},` `{0, -1, -1},` `{0, 0, 0, 0},` `{0, 0, 0, 0, 0},` `{0, 0, 1, 1, 1, 1},` `{0, 0, 1, 1, 1, 1, 1},` `{0, 0, 1, 1, 1, 1, 1, 1},` `{0, 0, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},` `{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},` `{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},` `{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},` `{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}`
	CROSSREFS	`Cf. A000720, A006880, A007053, A075986, A059305.` `Sequence in context: A162549 A179761 A102863 * A077052 A133566 A077051` `Adjacent sequences: A131480 A131481 A131482 * A131484 A131485 A131486`
	KEYWORD	`tabl,sign`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Oct 01 2007`

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

Last modified February 16 13:02 EST 2012. Contains 205909 sequences.