id:A059321 - OEIS Search Results

Search: id:A059321

Displaying 1-1 of 1 results found.

page 1

Smallest number m such that m^2+1 is divisible by A002144(n)^2 (= squares of primes congruent to 1 mod 4).

+0
8

7, 70, 38, 41, 117, 378, 500, 682, 776, 3861, 4052, 515, 5744, 1710, 6613, 1744, 11018, 13241, 3458, 5099, 1393, 16610, 26884, 15006, 2072, 13637, 31361, 4443, 26508, 7850, 37520, 31152, 39922, 37107, 6072, 4005, 32491, 4030, 43211, 12238 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`a(2) = 70 since A002144(2)=13, 70^2+1 = 4091 = 13^2 * 29 and for no k<70 does 13^2 divide k^2+1. Related to period-1 continued fractions.`
	LINKS	`Klaus Brockhaus, Table of n, a(n) for n=1..2000`
	CROSSREFS	`Cf. A002144, A059591, A059592.` `Sequence in context: A084774 A025757 A121351 this_sequence A077683 A082797 A121027` `Adjacent sequences: A059318 A059319 A059320 this_sequence A059322 A059323 A059324`
	KEYWORD	`easy,nonn`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com), Jan 26 2001`

page 1

Search completed in 0.002 seconds

Last modified December 17 13:29 EST 2009. Contains 170826 sequences.

AT&T Labs Research