A058064 - OEIS

This site is supported by donations to The OEIS Foundation.

A058064

Find least k such that (n+1)^k + n^k is a prime (A057856); then k=2^m and sequence gives values of m.

0, 0, 0, 1, 0, 0, 1, 0, 0, 5, 0, 1, 2, 0, 0, 2, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,10`
	MATHEMATICA	`Do[ k = 0; While[ !PrimeQ[ (n + 1)^(2^k) + n^(2^k) ], k++ ]; Print[ 2^k ], {n, 1, 60} ].`
	CROSSREFS	`Cf. A057856.` `Sequence in context: A199916 A180494 A200653 * A198927 A198100 A104112` `Adjacent sequences: A058061 A058062 A058063 * A058065 A058066 A058067`
	KEYWORD	`hard,nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 14 2000`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 08:49 EST 2012. Contains 205740 sequences.