id:A053665 - OEIS Search Results

Search: id:A053665

Displaying 1-1 of 1 results found.

page 1

Smallest number m such that m = i^2 mod prime(i) for 1<=i<=n.

+0
2

1, 1, 19, 79, 289, 18769, 198949, 6325069, 103321969, 1218786319, 98264184769, 3708353007109, 226330497051409, 2964582868796299, 120709434853826569, 21641851825451025919, 738603338323632009979 (list; graph; listen)

	OFFSET	`1,3`
	EXAMPLE	`3rd tem is 19 because this is the smallest number such that n = 1^2 mod 2, n = 2^2 mod 3 and n = 3^2 mod 5.`
	CROSSREFS	`Sequence in context: A158491 A139941 A127270 this_sequence A050522 A071633 A044206` `Adjacent sequences: A053662 A053663 A053664 this_sequence A053666 A053667 A053668`
	KEYWORD	`easy,nonn`
	AUTHOR	`Joe K. Crump (joecr(AT)carolina.rr.com), Feb 16 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research