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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073097 Let x(n) denote the number of 4's among the n first elements of the continued fraction for sum k>=0 1/2^(2^k) (A007400 ), y(n) the number of 6's and z(n) the number of 2's. Then a(n)=x(n)-y(n)-z(n)-1. 3
-1, -1, 0, -1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, 1, 0, -1, 0, -1, 0, 1, 0, 1, 0, -1, 0, 1, 0, 1, 0, -1, 0, -1, 0, -1, 0, 1, 0, -1, 0, -1 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

The positive sequence has a(n)=mod(A000120(A047849(n)),2)=mod(A000120(A078008(2n)),2) - Paul Barry (pbarry(AT)wit.ie), Jan 13 2005

Cosh(1) in 'reflected factorial' base is 1.10101010101010101010101010101010101010101010... - see A091337 for Sinh(1) (from Robert G. Wilson v (rgwv(AT)rgwv.com), May 04 2005)

FORMULA

It seems that a(2k+1)=0 for k>=1.

The positive sequence (assuming the pattern continues) has g.f. (1+x-x^2)/((1-x)(1-x^2)), with a(n)=(1-(1)^n)/2+0^n=mod((1+A001045(n+1))/2, 2) =mod(A005578, 2). The partial sums are A008619(n+1). - Paul Barry (pbarry(AT)wit.ie), Apr 28 2004

CROSSREFS

Cf. A007400.

Sequence in context: A080545 A141735 A178225 * A117569 A135528 A163805

Adjacent sequences:  A073094 A073095 A073096 * A073098 A073099 A073100

KEYWORD

sign

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 18 2002

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 11:36 EST 2012. Contains 205623 sequences.