Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132995
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132995 a(n) = GCD(sum{k=1 to n} p(k), product{j=1 to n} p(j)), where p(k) is the kth prime. +0
1
2, 1, 10, 1, 14, 1, 2, 77, 10, 3, 10, 1, 238, 1, 82, 3, 110, 3, 2, 213, 2, 7, 874, 3, 530, 129, 158, 3, 370, 177, 430, 3, 994, 3, 2, 3, 646, 2747, 2914, 21, 3266, 3, 3638, 3, 2014, 3, 14, 4661, 1222, 5117 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The first 7 primes are 2,3,5,7,11,13,17. 2+3+5+7+11+13+17 = 58 = 2*29. So a(7) = GCD(58, 2*3*5*7*11*13*17) = 2.

MAPLE

seq(gcd(add(ithprime(i), i=1..n), mul(ithprime(j), j=1..n)), n=1..50); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 24 2007

CROSSREFS

Cf. A007504, A002110.

Sequence in context: A074951 A055633 A105606 this_sequence A114692 A112691 A110169

Adjacent sequences: A132992 A132993 A132994 this_sequence A132996 A132997 A132998

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Nov 22 2007

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 24 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 4 20:00 EST 2008. Contains 151309 sequences.


AT&T Labs Research