Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113860 Start with the binary representation of the Catalan constant (A104338, A006752) = 0.91596559... = sum_{i=1..infinity) b(i)/2^i, where b(i)=1,1,1,0,1,0,1,0,0,1,1,1,1.... Then a(n-1)=sum_{i=1..k: sum_{ j = 1..k} b(j)=n} b(i) * 2^(i-1). In words: scan the binary digits of the number, halt at each nonzero binary digit, add a power of 2 corresponding to the place of this digit after the comma, assign current partial sum to a(n), increment n. +0
3
1, 3, 7, 23, 87, 599, 1623, 3671, 7767, 15959, 81495, 343639, 867927, 1916503, 18693719, 152911447, 421346903, 958217815, 2031959639, 4179443287, 12769377879, 1112281005655, 9908374027863, 27500560072279, 97869304249943 (list; graph; listen)
OFFSET

0,2

COMMENT

An instance of a Jasinski Integer Sequence using the convention JIS[number,counting system] as defined for example in A080355. This is JIS [Catatlan constant,binary]=JIS[0.9159655941772190150546..,2].

CROSSREFS

Cf. A080355, A080567, A099969, A099970, A099971, A099972.

Sequence in context: A104088 A136508 A099152 this_sequence A080355 A100964 A080077

Adjacent sequences: A113857 A113858 A113859 this_sequence A113861 A113862 A113863

KEYWORD

nonn,base

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Jan 25 2006

EXTENSIONS

Naming a sequence after oneself is deprecated. - njas

Corrected and extended by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 31 2007

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research