id:A053000 - OEIS Search Results

Search: id:A053000

Displaying 1-1 of 1 results found.

page 1

(Smallest prime > n^2) - n^2.

+0
14

2, 1, 1, 2, 1, 4, 1, 4, 3, 2, 1, 6, 5, 4, 1, 2, 1, 4, 7, 6, 1, 2, 3, 12, 1, 6, 1, 4, 3, 12, 7, 6, 7, 2, 7, 4, 1, 4, 3, 2, 1, 12, 13, 12, 13, 2, 13, 4, 5, 10, 3, 8, 3, 10, 1, 12, 1, 2, 7, 10, 7, 6, 3, 20, 3, 4, 1, 4, 13, 22, 3, 10, 5, 4, 1, 14, 3, 10, 5, 6, 21, 2, 9, 10, 1, 4, 15, 4, 9, 6, 1, 6, 3, 14 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`Suggested by Legendre's conjecture (still open) that there is always a prime between n^2 and (n+1)^2.`
	REFERENCES	`J. R. Goldman, The Queen of Mathematics, 1998, p. 82.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=0..10000`
	MAPLE	`A053000 := n->nextprime(n^2)-n^2;`
	CROSSREFS	`Cf. A007491, A053001, A014085, A070316.` `Sequence in context: A113926 A165585 A082506 this_sequence A002070 A106052 A050473` `Adjacent sequences: A052997 A052998 A052999 this_sequence A053001 A053002 A053003`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2000`
	EXTENSIONS	`More terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 22 2000`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research