id:A058064 - OEIS Search Results

Search: id:A058064

Displaying 1-1 of 1 results found.

page 1

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
2

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; listen)

	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: A060338 A132795 A085198 this_sequence A104112 A115635 A019729` `Adjacent sequences: A058061 A058062 A058063 this_sequence A058065 A058066 A058067`
	KEYWORD	`hard,nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 14 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.