Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140129
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140129 a(n) = numerator of c(n) = if n=1 then 0 else if n < 3*2^[Log2(n)-1] then (c([n/2])+c([(n+1)/2]))/2 else c(n-2^[Log2(n)])+1;. +0
4
0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 3, 1, 3, 2, 3, 0, 1, 1, 3, 1, 5, 3, 7, 1, 5, 3, 7, 2, 5, 3, 4, 0, 1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 11, 3, 13, 7, 15, 1, 9, 5, 11, 3, 13, 7, 15, 2, 9, 5, 11, 3, 7, 4, 5, 0, 1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 11, 3, 13, 7, 15, 1, 17, 9, 19, 5, 21, 11, 23, 3, 25, 13, 27, 7, 29, 15, 31 (list; graph; listen)
OFFSET

1,7

COMMENT

C(k) = {a(n)/A140130(n): 2^(k-1) <= n < 2^k} = nonnegative Conway

numbers created on day k according the genesis reported by Knuth.

c(2^n-1) = n-1; c(2^n) = 0; c(3*2^n) = 1; c(5*2^n) = 1/2;

for n>1: a(A023758(n))=A002262(n-2) and A140130(A023758(n))=1;

a(n)=a(n-2^[Log2(n))+A140130(n-2^[Log2(n)) for n with

3*2^[Log2(n)-1]<=n<2^[Log2(n)].

REFERENCES

D. E. Knuth, Surreal Numbers, Addison-Wesley, Reading, 1974.

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..8191

EXAMPLE

C(1)={0};

C(2)={0,1};

C(3)={0,1/2,1,2};

C(4)={0,1/4,1/2,3/4,1,3/2,2,3};

C(5)={0,1/8,1/4,3/8,1/2,5/8,3/4,7/8,1,5/4,3/2,7/4,2,5/2,3,4}.

CROSSREFS

Cf. A000523, A007283.

Sequence in context: A079603 A055186 A124035 this_sequence A029347 A058725 A068446

Adjacent sequences: A140126 A140127 A140128 this_sequence A140130 A140131 A140132

KEYWORD

nonn,frac

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 14 2008

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research