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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081411 Partial product of prime gaps: a(n) = a(n-1)*(prime(n+1) - prime(n)). 1
1, 2, 4, 16, 32, 128, 256, 1024, 6144, 12288, 73728, 294912, 589824, 2359296, 14155776, 84934656, 169869312, 1019215872, 4076863488, 8153726976 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Original name was: Generated by recursion: a(n)=(Mod[Prime[n+1],Prime[n]]*n[n-1]; a[0]=1; Product of the first n consecutive prime-differences.

LINKS

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

PROG

(PARI) diff(v)=vector(#v-1, i, v[i+1]-v[i])

pprod(v)=my(t=1); vector(#v, i, t*=v[i])

pprod(diff(primes(50))) \\ Charles R Greathouse IV, Mar 27 2014

CROSSREFS

Cf. A001223, A080374, A080375, A080376.

Sequence in context: A171381 A274497 A145119 * A269758 A094384 A053038

Adjacent sequences:  A081408 A081409 A081410 * A081412 A081413 A081414

KEYWORD

nonn

AUTHOR

Labos Elemer, Apr 01 2003

EXTENSIONS

New name from Charles R Greathouse IV, Mar 27 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 17 19:35 EST 2017. Contains 294834 sequences.