id:A094929 - OEIS Search Results

Search: id:A094929

Displaying 1-1 of 1 results found.

page 1

Let p = n-th prime; a(n) = smallest odd prime q such that p is not a square mod q.

+0
3

3, 5, 3, 5, 3, 7, 3, 3, 7, 5, 3, 5, 3, 3, 3, 7, 5, 3, 5, 11, 3, 3, 5, 3, 5, 3, 11, 3, 5, 3, 3, 7, 3, 11, 5, 5, 3, 3, 3, 7, 3, 5, 3, 7, 11, 5, 3, 7, 3, 3, 7, 3, 3, 3, 3, 7, 5, 3, 5, 3, 5, 3, 5, 3, 13, 5, 3, 7, 3, 3, 5, 5, 13, 3, 3, 5, 3, 7, 3, 13, 3, 5, 7, 3, 3, 5, 3, 5, 3, 3, 5, 3, 13, 3, 3, 3, 5, 11, 5 (list; graph; listen)

	OFFSET	`3,1`
	MATHEMATICA	`f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Prime[Range[3, 100]] (from Robert G. Wilson v Jun 24 2004)`
	CROSSREFS	`Cf. A094928, A096633, A096634, A096635.` `Sequence in context: A107489 A152050 A103506 this_sequence A096634 A105439 A142972` `Adjacent sequences: A094926 A094927 A094928 this_sequence A094930 A094931 A094932`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jun 19 2004`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research