id:A056898 - OEIS Search Results

Search: id:A056898

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest number m such that m^2+n is prime.

+0
7

1, 0, 0, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 1, 0, 3, 4, 1, 0, 7, 2, 9, 2, 1, 0, 1, 0, 3, 2, 3, 6, 1, 0, 3, 2, 1, 0, 1, 0, 3, 4, 1, 0, 5, 2, 3, 4, 1, 0, 5, 2, 9, 2, 1, 0, 1, 0, 3, 2, 3, 6, 1, 0, 9, 2, 1, 0, 1, 0, 3, 2, 5, 6, 1, 0, 3, 4, 1, 0, 5, 2, 9, 4, 1, 0, 7, 4, 3, 2, 3, 6, 1, 0, 3, 2 (list; graph; listen)

	OFFSET	`1,8`
	FORMULA	`a(n) = sqrt(A056896(n)-n) = sqrt(A056897(n)). For p a prime: a(p) = 0 (and a(p-1) = 1 if p<>3).`
	EXAMPLE	`a(8) = 3 since 3^2+8 = 17 which is prime`
	CROSSREFS	`Cf. A000040, A002496, A056892-A056898.` `Adjacent sequences: A056895 A056896 A056897 this_sequence A056899 A056900 A056901` `Sequence in context: A083199 A021761 A071960 this_sequence A062160 A022959 A023445`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jul 05 2000`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research