id:A090629 - OEIS Search Results

Search: id:A090629

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

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

page 1

Search completed in 0.002 seconds

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.

AT&T Labs Research