id:A089607 - OEIS Search Results

Search: id:A089607

Displaying 1-1 of 1 results found.

page 1

a(n)=((-1)^(n+1)*A002425(n)) modulo 4.

+0
1

1, 3, 1, 3, 3, 1, 1, 3, 3, 3, 1, 1, 3, 1, 1, 3, 3, 3, 1, 3, 3, 1, 1, 1, 3, 3, 1, 1, 3, 1, 1, 3, 3, 3, 1, 3, 3, 1, 1, 3, 3, 3, 1, 1, 3, 1, 1, 1, 3, 3, 1, 3, 3, 1, 1, 1, 3, 3, 1, 1, 3, 1, 1, 3, 3, 3, 1, 3, 3, 1, 1, 3, 3, 3, 1, 1, 3, 1, 1, 3, 3, 3, 1, 3, 3, 1, 1, 1, 3, 3, 1, 1, 3, 1, 1, 1, 3, 3, 1, 3, 3, 1, 1, 3, 3 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(1)=1; for n>=2, a(n) = 2*A014577(n-1)+1`
	PROGRAM	`(PARI) a(n)=numerator(2/n(4^n-1)bernfrac(2*n))%4`
	CROSSREFS	`Cf. A056832.` `Sequence in context: A124814 A122567 A122431 this_sequence A050141 A132752 A131241` `Adjacent sequences: A089604 A089605 A089606 this_sequence A089608 A089609 A089610`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 30 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research