id:A100867 - OEIS Search Results

Search: id:A100867

Displaying 1-1 of 1 results found.

page 1

Let a_n be the n-th term of the sequence and b_n the n-th non-square positive integer (thus b_1=2, b_2=3,...); then a_n is the smallest positive integer k such that b_n mod k is not a quadratic residue modulo k.

+0
1

3, 4, 3, 4, 4, 3, 4, 3, 5, 5, 3, 4, 3, 4, 4, 3, 8, 4, 3, 7, 3, 4, 5, 3, 4, 4, 3, 5, 4, 3, 5, 3, 4, 7, 3, 4, 4, 3, 7, 4, 3, 5, 3, 4, 5, 3, 4, 4, 3, 5, 4, 3, 9, 7, 3, 4, 3, 4, 4, 3, 7, 4, 3, 5, 5, 3, 4, 7, 3, 4, 4, 3, 4, 3, 9, 8, 3, 4, 5, 3, 4, 4, 3, 5, 4, 3, 7, 5, 3, 4, 3, 4, 4, 3, 9, 4, 3, 5, 8, 3, 4, 5, 3, 4, 4 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a_1=3 because the first non-square positive integer is 2 and 2 is not a quadratic residue modulo 3.`
	CROSSREFS	`Sequence in context: A066783 A046536 A052384 this_sequence A128200 A061988 A094151` `Adjacent sequences: A100864 A100865 A100866 this_sequence A100868 A100869 A100870`
	KEYWORD	`nonn`
	AUTHOR	`Guilherme de Queiroz Hobbs (guilhermehobbs(AT)uol.com.br), Jan 08 2005`
	EXTENSIONS	`Corrected and xtended by David Wasserman (dwasserm(AT)earthlink.net), Mar 04 2008`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research