The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A091953 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A091953

a(1)=1, a(2n)=1+a(n)(mod 2); a(2n+1)=2*a(2n)+1.
(history; published version)

#5 by Russ Cox at Fri Mar 30 18:39:22 EDT 2012

AUTHOR

_Benoit Cloitre (benoit7848c(AT)orange.fr), _, Mar 11 2004

Discussion

Fri Mar 30

18:39

OEIS Server: https://oeis.org/edit/global/216

#4 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

KEYWORD

nonn,new

nonn

AUTHOR

Benoit Cloitre (abmtbenoit7848c(AT)wanadooorange.fr), Mar 11 2004

#3 by N. J. A. Sloane at Wed Sep 21 03:00:00 EDT 2005

KEYWORD

nonn,new

nonn

AUTHOR

Benoit Cloitre (abcloitreabmt(AT)modulonetwanadoo.fr), Mar 11 2004

#2 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005

KEYWORD

nonn,new

nonn

AUTHOR

Benoit Cloitre (abcloitre(AT)wanadoomodulonet.fr), Mar 11 2004

#1 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004

NAME

a(1)=1, a(2n)=1+a(n)(mod 2); a(2n+1)=2*a(2n)+1.

DATA

1, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 2, 5, 2, 5, 1, 3, 2, 5, 2, 5

OFFSET

1,2

COMMENTS

a(n) mod 2 = A035263(n)

FORMULA

a(A003159(n))=1; a(2*A003159(n))=2; a(4*A003159(n)+1)=3; a(2*A003159(n)+1)=5

PROG

(PARI) a(n)=if(n<2, 1, if(n%2, 2*a(n-1)+1, 1+a(n/2)%2))

KEYWORD

nonn

AUTHOR

Benoit Cloitre (abcloitre(AT)wanadoo.fr), Mar 11 2004

STATUS

approved