id:A094049 - OEIS Search Results

Search: id:A094049

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 k for which m^2+1=p(n)*k^2 has a solution.

+0
2

1, 5, 1, 13, 1, 5, 25, 3805, 125, 53, 569, 1, 851525, 73, 149, 9305, 385645, 85, 82596761, 126985, 1, 113, 1517, 4574225, 1, 5, 535979945, 63445, 145, 7170685, 19805, 55335641, 493, 3793, 265, 65, 1027776565, 1 (list; graph; listen)

	OFFSET	`1,2`
	CROSSREFS	`Cf. A002144, A094048.` `Sequence in context: A125232 A116923 A062264 this_sequence A147348 A081224 A104793` `Adjacent sequences: A094046 A094047 A094048 this_sequence A094050 A094051 A094052`
	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