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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075694 a(1)=1, then "jump over next prime": a(n) = 2 nextprime(a(n-1))-a(n-1). 3
1, 3, 7, 15, 19, 27, 31, 43, 51, 55, 63, 71, 75, 83, 95, 99, 103, 111, 115, 139, 159, 167, 179, 183, 199, 223, 231, 235, 243, 259, 267, 271, 283, 303, 311, 315, 319, 343, 351, 355, 363, 371, 375, 383, 395, 399, 403, 415, 423, 439, 447, 451, 463, 471, 487, 495 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The rule "jump over next smth" can be varied. In the A075695 the example: "jump over next second prime" is given.

LINKS

Table of n, a(n) for n=1..56.

FORMULA

a(1)=1, a(n) = 2 nextprime(a(n-1))-a(n-1).

EXAMPLE

a(1)=1; next prime (smallest larger than a(1))=2; "jump over" it: 2+(2-1)=3; a(2)=3; next prime (smallest larger than a(2))=5; "jump over" it: 5+(5-3)=7; a(7)=31; next prime (smallest larger than a(7))=37; "jump over" it: 37+(37-31)=43.

MAPLE

a(1) := 1; a(n)=2*nextprime(a(n-1))-a(n-1);

CROSSREFS

Cf. A075695.

Sequence in context: A089432 A111294 A092899 * A186300 A144751 A138847

Adjacent sequences:  A075691 A075692 A075693 * A075695 A075696 A075697

KEYWORD

easy,nonn

AUTHOR

Zak Seidov, Sep 26 2002

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified September 20 03:54 EDT 2014. Contains 246983 sequences.