id:A087893 - OEIS Search Results

Search: id:A087893

Displaying 1-1 of 1 results found.

page 1

Number of numbers m satisfying 1 < m < n such that m^2=m (mod n).

+0
1

0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 0, 2, 0, 2, 2, 2, 0, 2, 0, 2, 0, 2, 0, 6, 0, 0, 2, 2, 2, 2, 0, 2, 2, 2, 0, 6, 0, 2, 2, 2, 0, 2, 0, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 6, 0, 2, 2, 0, 2, 6, 0, 2, 2, 6, 0, 2, 0, 2, 2, 2, 2, 6, 0, 2, 0, 2, 0, 6, 2, 2, 2, 2, 0, 6, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 0, 6, 0, 2, 6 (list; graph; listen)

	OFFSET	`1,6`
	REFERENCES	`C. R. J. Singleton, "Prime Function Problem": Solution to Problem 2355, Journal of Recreational Mathematics, Vol. 29(3) pp. 232-234, 1998.`
	FORMULA	`a(n) = 2^{omega(n)} - 2 = 2*A079275(n).`
	CROSSREFS	`Cf. A001221, A007875, A079275.` `Sequence in context: A069847 A097249 A112313 this_sequence A079169 A097106 A165619` `Adjacent sequences: A087890 A087891 A087892 this_sequence A087894 A087895 A087896`
	KEYWORD	`nonn`
	AUTHOR	`Lekraj Beedassy (blekraj(AT)yahoo.com), Oct 13 2003`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research