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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100803 A100802(m) where A100802(m) > A100802(m-1). 1
1, 3, 3, 7, 3, 7, 3, 7, 11, 3, 11, 7, 3, 7, 11, 11, 3, 11, 7, 3, 11, 7, 11, 15, 7, 3, 7, 3, 7, 27, 7, 11, 3, 19, 3, 11, 11, 7, 11, 11, 3, 19, 3, 7, 3, 23, 23, 7, 3, 7, 11, 3, 19, 11, 11, 11, 3, 11, 7, 3, 19, 27, 7, 3, 7, 27, 11, 19, 3, 7, 11, 15, 11, 11, 7, 11, 15, 7, 15, 19, 3, 19, 3, 11 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n) = A100802(2prime(n)+1) = 2(prime(n+1)-prime(n))-1 = 2*A001223(n)-1.

MATHEMATICA

Table[2*(Prime[n + 1] - Prime[n]) - 1, {n, 100}]

CROSSREFS

Cf. A100802.

Sequence in context: A089488 A076560 A096915 * A036840 A159913 A183061

Adjacent sequences:  A100800 A100801 A100802 * A100804 A100805 A100806

KEYWORD

nonn,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 18 2004

EXTENSIONS

Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 19 2005

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 14 11:36 EST 2012. Contains 205623 sequences.