Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097489
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097489 a(n) = product of first n terms of A001359. +0
4
3, 15, 165, 2805, 81345, 3335145, 196773555, 13970922405, 1411063162905, 150983758430835, 20684774905024395, 3082031460848634855, 551683631491905639045, 105371573614953977057595 (list; graph; listen)
OFFSET

1,1

PROGRAM

(PARI) f(n) = p=1; for(x=1, n, p*=twinl(x); print1(p", ")) \The n-th lower twin prime twinl(n) = { local(c, x); c=0; x=1; while(c<n, if(isprime(prime(x)+2), c++); x++; ); return(prime(x-1)) }

CROSSREFS

Cf. A001359, A097492.

Sequence in context: A005016 A105611 A108975 this_sequence A080696 A015013 A153280

Adjacent sequences: A097486 A097487 A097488 this_sequence A097490 A097491 A097492

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Aug 24 2004

EXTENSIONS

Edited by Don Reble (djr(AT)nk.ca), Apr 16 2007

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 December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research