login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089608 a(n) = ((-1)^(n+1)*A002425(n)) modulo 6. 2
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; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

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).

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..65536

Index entries for sequences related to binary expansion of n

Index entries for sequences that are fixed points of mappings

FORMULA

a(n) = 5 - 4*A035263(n).

PROG

(PARI) a(n)=numerator(2/n*(4^n-1)*bernfrac(2*n))%6

(PARI) a(n)=valuation(n, 2)%2 * 4 + 1; \\ Andrew Howroyd, Aug 01 2018

(Scheme)

(define (A035263 n) (let loop ((n n) (i 1)) (cond ((odd? n) (modulo i 2)) (else (loop (/ n 2) (+ 1 i))))))

(define (A089608 n) (- 5 (* 4 (A035263 n))))

;; Antti Karttunen, Sep 11 2017

CROSSREFS

Cf. A035263, A056832.

Sequence in context: A069293 A293235 A066803 * A250131 A100615 A293897

Adjacent sequences:  A089605 A089606 A089607 * A089609 A089610 A089611

KEYWORD

nonn,mult

AUTHOR

Benoit Cloitre, Dec 30 2003

EXTENSIONS

Keyword:mult added by Andrew Howroyd, Aug 01 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 14 09:49 EST 2018. Contains 317182 sequences. (Running on oeis4.)