id:A066787 - OEIS Search Results

Search: id:A066787

Displaying 1-1 of 1 results found.

page 1

GCD( 2^n + 1, n^2 + 1).

+0
1

1, 5, 1, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 65, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 41, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 29, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 565, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n)=1 or a(n)=0 mod(5) or a(n) is a prime congruent to 1 mod(4).`
	CROSSREFS	`Sequence in context: A039807 A019429 A093826 this_sequence A058352 A121755 A104174` `Adjacent sequences: A066784 A066785 A066786 this_sequence A066788 A066789 A066790`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 18 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research