A098877 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A098877

Least k such that 3*(6*n)^k + 1 is prime.

1, 1, 3, 1, 3, 1, 1, 3, 1, 1, 1, 14, 2, 2, 1, 3, 1, 270, 12, 2, 1, 1, 8, 1, 3, 2, 1, 2, 1, 1, 12, 1, 11, 1, 1, 2, 2, 12, 3, 2, 1, 1, 8, 2, 1, 1, 2, 3, 1, 2, 1, 1, 11, 3, 1, 1, 14, 2, 1, 16, 24, 1, 4, 1, 1, 3, 9, 3, 66, 4, 1, 1, 3, 6, 3, 3, 2, 7, 1, 3, 1, 156, 3, 2, 1, 1, 1, 12, 77, 1, 5, 1, 20, 1, 3, 2 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,3`
	LINKS	`Table of n, a(n) for n=1..96.`
	FORMULA	`a(A111094(n)) = 1. - Michel Marcus, Jul 28 2015`
	MATHEMATICA	`f[n_] := Block[{k = 1}, While[ !PrimeQ[3((6n)^k) + 1], k++ ]; k]; Table[ f[n], {n, 96}] (* Robert G. Wilson v, Oct 21 2004 *)`
	CROSSREFS	`Cf. A098876, A111094.` `Sequence in context: A066975 A355879 A291634 * A225212 A091088 A335915` `Adjacent sequences: A098874 A098875 A098876 * A098878 A098879 A098880`
	KEYWORD	`nonn`
	AUTHOR	`Pierre CAMI, Oct 13 2004`
	EXTENSIONS	`More terms from Robert G. Wilson v, Oct 21 2004`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 28 19:31 EST 2022. Contains 359109 sequences. (Running on oeis4.)