Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086769
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086769 a(n) = sum{2^(b(i)-1): 1<=i<=n}, where b(n) is the differences between consecutive primes. +0
1
1, 3, 5, 13, 15, 23, 25, 33, 65, 67, 99, 107, 109, 117, 149, 181, 183, 215, 223, 225, 257, 265, 297, 425, 433, 435, 443, 445, 453, 8645, 8653, 8685, 8687, 9199, 9201, 9233, 9265, 9273, 9305, 9337, 9339, 9851, 9853, 9861, 9863, 11911, 13959, 13967, 13969 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n) = a(n-1)+2^(p(n+1)-p(n)-1).

EXAMPLE

2^(3-2)/2=1, so a(1)=1. 2^(5-3)/2=2, so a(2)=1+2=3.

PROGRAM

(Matlab) P = primes(500); l = length(P); S = P(2:l) - P(1:(l - 1)); A = cumsum(2.^(S-1))

CROSSREFS

Cf. A001223.

Sequence in context: A099791 A028268 A137162 this_sequence A018753 A073217 A063484

Adjacent sequences: A086766 A086767 A086768 this_sequence A086770 A086771 A086772

KEYWORD

nonn,easy

AUTHOR

David G. Williams (davwill24(AT)aol.com), Aug 02 2003

EXTENSIONS

Edited by David Wasserman (wasserma(AT)spawar.navy.mil), Aug 28 2003

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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research