id:A152823 - OEIS Search Results

Search: id:A152823

Displaying 1-1 of 1 results found.

page 1

Largest divisor < n of n^2+1.

+0
1

1, 1, 2, 1, 2, 1, 5, 5, 2, 1, 2, 5, 10, 1, 2, 1, 10, 13, 2, 1, 17, 5, 10, 1, 2, 1, 10, 5, 2, 17, 26, 25, 10, 13, 2, 1, 10, 17, 2, 1, 29, 5, 37, 13, 2, 29, 34, 5, 2, 41, 2, 5, 10, 1, 34, 1, 50, 5, 2, 13, 2, 5, 10, 17, 2, 1, 10, 37, 2, 29, 2, 61, 65, 1, 58, 53, 10, 5, 2, 37, 34, 25, 65, 1, 2, 13 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`a(n)=1 iff n^2+1 is prime (iff A147809(n)=0), which can only happen for n=1 or even n. If a(2k)=3, then 4k^2+1=3p with p prime. For odd n>1, a(n) >= 2, with equality if (n^2+1)/2 is prime. Conversely, A147809(n)=1 iff n^2+1 is a semiprime, which for odd n>1 implies a(n) = 2.`
	PROGRAM	`(PARI) A152823(n)={ n=divisors(n^2+1); n[ #n\2] }`
	CROSSREFS	`Sequence in context: A109087 A102048 A102551 this_sequence A086545 A126083 A071416` `Adjacent sequences: A152820 A152821 A152822 this_sequence A152824 A152825 A152826`
	KEYWORD	`nonn`
	AUTHOR	`M. F. Hasler (MHasler(AT)univ-ag.fr), Dec 15 2008`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research