id:A089608 - OEIS Search Results

Search: id:A089608

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`1,2`
	COMMENT	`Let S(1)={1} and S(n+1)=S(n)S'(n) where S'(n) is obtained from S(n) by changing last term using the cyclic permutation 1->5->1, then sequence is S(infinity)`
	FORMULA	`a(n)=5-4*A035263(n)`
	PROGRAM	`(PARI) a(n)=numerator(2/n(4^n-1)bernfrac(2*n))%6`
	CROSSREFS	`Cf. A035263, A056832.` `Sequence in context: A109768 A069293 A066803 this_sequence A100615 A102280 A035316` `Adjacent sequences: A089605 A089606 A089607 this_sequence A089609 A089610 A089611`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Dec 30 2003`

page 1

Search completed in 0.002 seconds

Last modified September 7 15:23 EDT 2008. Contains 143483 sequences.

AT&T Labs Research