id:A094048 - OEIS Search Results

Search: id:A094048

Displaying 1-1 of 1 results found.

page 1

Let p(n) be the n-th prime congruent to 1 mod 4. Then a(n) = the least m for which m^2+1=p(n)*k^2 has a solution.

+0
2

2, 18, 4, 70, 6, 32, 182, 29718, 1068, 500, 5604, 10, 8890182, 776, 1744, 113582, 4832118, 1118, 1111225770, 1764132, 14, 1710, 23156, 71011068, 16, 82, 8920484118, 1063532, 2482, 126862368, 352618 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Cf. A002144, A094049.` `Sequence in context: A112969 A077452 A113918 this_sequence A087665 A093481 A132629` `Adjacent sequences: A094045 A094046 A094047 this_sequence A094049 A094050 A094051`
	KEYWORD	`nonn`
	AUTHOR	`Matthijs Coster (matthijs(AT)coster.demon.nl), Apr 29 2004`
	EXTENSIONS	`Edited by Don Reble (djr(AT)nk.ca), Apr 30 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research