id:A080121 - OEIS Search Results

Search: id:A080121

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest k>0 such that the sum n^2^k + (n+1)^2^k is prime, or -1 if no such k exists.

+0
2

1, 1, 2, 1, 1, 2, 1, 2, 1, 5 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`This sequence is log2 of A077659. It is known that a(11) > 22. Is it possible that 11^2^k + 12^2^k is composite for all k > 0?`
	LINKS	`T. D. Noe, Factorizations of Generalized Fermat Numbers 12^2^k + 11^2^k`
	CROSSREFS	`Cf. A077659.` `Adjacent sequences: A080118 A080119 A080120 this_sequence A080122 A080123 A080124` `Sequence in context: A049843 A131374 A013632 this_sequence A122901 A001917 A091591`
	KEYWORD	`hard,more,nonn`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Jan 29 2003`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.