A099618 - OEIS

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

A099618

a(n) = 1 if the n-th prime == 1 mod 6, otherwise a(n) = 0.

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

	OFFSET	`1,1`
	LINKS	`Table of n, a(n) for n=1..105.` `Index entries for characteristic functions`
	MATHEMATICA	`Table[Mod[Mod[Mod[Mod[Prime[k], 6], 5], 3], 2], {k, 1, 120}]`
	PROG	`(PARI) a(n) = (prime(n) % 6) == 1; \\ Michel Marcus, Jun 26 2019`
	CROSSREFS	`Cf. A000040, A039704, A091178.` `Sequence in context: A341609 A064911 A174898 * A360125 A324883 A106002` `Adjacent sequences: A099615 A099616 A099617 * A099619 A099620 A099621`
	KEYWORD	`nonn`
	AUTHOR	`Joseph Biberstine (jrbibers(AT)indiana.edu), Nov 19 2004`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 6 11:35 EST 2023. Contains 360934 sequences. (Running on oeis4.)