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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A089607 a(n)=((-1)^(n+1)*A002425(n)) modulo 4. 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; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..105. FORMULA a(1)=1; for n>=2, a(n) = 2*A014577(n-1)+1 PROG (PARI) a(n)=numerator(2/n*(4^n-1)*bernfrac(2*n))%4 CROSSREFS Cf. A056832. Sequence in context: A122567 A122431 A279340 * A216637 A358643 A234308 Adjacent sequences: A089604 A089605 A089606 * A089608 A089609 A089610 KEYWORD nonn AUTHOR Benoit Cloitre, Dec 30 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 13:25 EDT 2023. Contains 365531 sequences. (Running on oeis4.)