Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060381
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060381 a(n) = p(n)*p(n+1)*....*p(2*n-1), where p(i) = i-th prime. +0
2
2, 15, 385, 17017, 1062347, 86822723, 10131543907, 1204461778591, 198229051666003, 35224440615606707, 6295457783127226289, 1331590860773071702483, 310692537866322378582047 (list; graph; listen)
OFFSET

1,1

EXAMPLE

a(1)=2, a(2)=3*5=15, a(3)=5*7*11=385.

CROSSREFS

Sequence in context: A068391 A132874 A071102 this_sequence A145328 A139810 A012943

Adjacent sequences: A060378 A060379 A060380 this_sequence A060382 A060383 A060384

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Apr 03 2001

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research