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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080355 a(1)=1; for n>1, a(n) = a(n-1) + 2^(j-1), where j is position of n-th 1 in A080339. 17
1, 3, 7, 23, 87, 1111, 5207, 70743, 332887, 4527191, 272962647, 1346704471, 70066181207, 1169577808983, 5567624320087, 75936368497751, 4579535995868247, 292809912147579991, 1445731416754426967 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Or, take an initial segment of A080339, stopping at the n-th 1, reverse and interpret as a binary number. E.g. to get the 4-th term: 11101 -> 10111 = 23, so a(4) = 23.

FORMULA

a(n) = 1 + Sum_{k=1..n-1} 2^(prime(k)-1).

CROSSREFS

Cf. A076793.

Sequence in context: A184935 A099152 A113860 * A100964 A080077 A096318

Adjacent sequences:  A080352 A080353 A080354 * A080356 A080357 A080358

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), based on information supplied by Artur Jasinski (grafix(AT)csl.pl), Mar 21 2003

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 26 2003

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 15 20:26 EST 2012. Contains 205852 sequences.