A090629 - OEIS

This site is supported by donations to The OEIS Foundation.

A090629

a(n) = abs(numerator of 2n-th Bernoulli number) modulo 3.

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

	OFFSET	`0,6`
	FORMULA	`a(n) = abs(A000367(n)) (mod 3)`
	PROG	`(PARI) a(n)=abs(numerator(bernfrac(2*n)))%3`
	CROSSREFS	`Sequence in context: A109374 A079706 A078703 * A086412 A192006 A006928` `Adjacent sequences: A090626 A090627 A090628 * A090630 A090631 A090632`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 13 2003`

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

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.