Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145572
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A145572 Numerators of partial sums for Liouville's constant, read as base 2 (binary) numbers. +0
2
1, 3, 49, 12845057, 1017690263500988729456314874071089153, 42229215926959528723625267363761610589200187649205197801477459638117448659923711\ 13095993596088044297100172572224585271942341064532181870606866447799704872724575\ 357044373908131956500952542608981420222196042850818326529 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) is A145572(n) (a decimal number with digits only from {0,1}) read as base 2 number converted back into decimal notation.

The sequence of digit lengths is [1,1,2,8,37,217,1518,...]

FORMULA

a(n)=A145572(n) interpreted as number in binary notation, then converted to decimal notation.

EXAMPLE

a(3)=49, because A145572(3)=110001, and the binary number 110001 translates to 2^5+2^4+2^0=32+16+1 = 49.

CROSSREFS

Cf. A145572 (numerators of approxiations for Liouville's number).

Sequence in context: A106842 A086459 A063893 this_sequence A034201 A099346 A075184

Adjacent sequences: A145569 A145570 A145571 this_sequence A145573 A145574 A145575

KEYWORD

nonn,easy

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Mar 06 2009

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research