Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118827
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118827 2-adic continued fraction of zero, where a(n) = if n=1(mod 2), +1, else -2*A006519(n/2). +0
6
1, -2, 1, -4, 1, -2, 1, -8, 1, -2, 1, -4, 1, -2, 1, -16, 1, -2, 1, -4, 1, -2, 1, -8, 1, -2, 1, -4, 1, -2, 1, -32, 1, -2, 1, -4, 1, -2, 1, -8, 1, -2, 1, -4, 1, -2, 1, -16, 1, -2, 1, -4, 1, -2, 1, -8, 1, -2, 1, -4, 1, -2, 1, -64, 1, -2, 1, -4, 1, -2, 1, -8, 1, -2, 1, -4, 1, -2, 1, -16, 1, -2, 1, -4, 1, -2, 1, -8, 1, -2, 1, -4, 1, -2, 1, -32, 1, -2, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

Limit of convergents equals zero; only the 6-th convergent is indeterminate. Other 2-adic continued fractions of zero are: A118821, A118824, A118830. A006519(n) is the highest power of 2 dividing n; A080277 = partial sums of A038712, where A038712(n) = 2*A006519(n) - 1.

EXAMPLE

For n>=1, convergents A118828(k)/A118829(k) are:

at k = 4*n: -1/(2*A080277(n));

at k = 4*n+1: -1/(2*A080277(n)-1);

at k = 4*n+2: -1/(2*A080277(n)-2);

at k = 4*n-1: 0.

Convergents begin:

1/1, -1/-2, 0/-1, -1/2, -1/1, 1/0, 0/1, 1/-8,

1/-7, -1/6, 0/-1, -1/10, -1/9, 1/-8, 0/1, 1/-24,

1/-23, -1/22, 0/-1, -1/26, -1/25, 1/-24, 0/1, 1/-32,

1/-31, -1/30, 0/-1, -1/34, -1/33, 1/-32, 0/1, 1/-64, ...

PROGRAM

(PARI) a(n)=local(p=+1, q=-2); if(n%2==1, p, q*2^valuation(n/2, 2))

CROSSREFS

Cf. A006519, A080277; convergents: A118828/A118829; variants: A118821, A118824, A118830; A100338.

Sequence in context: A003484 A006519 A055975 this_sequence A118830 A087258 A076775

Adjacent sequences: A118824 A118825 A118826 this_sequence A118828 A118829 A118830

KEYWORD

cofr,sign

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), May 01 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research