Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A132996
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A132996 a(n) = GCD(sum{k=1 to n} c(k), product{j=1 to n} c(j)), where c(k) is the kth composite. +0
1
4, 2, 6, 27, 1, 1, 63, 6, 2, 112, 12, 9, 175, 1, 224, 250, 1, 5, 5, 1, 400, 14, 7, 5, 3, 6, 2, 8, 12, 3, 17, 847, 896, 22, 1, 1, 1, 6, 2, 1, 3, 3, 1, 2, 6, 31, 1, 1, 26, 4, 28, 2, 1, 1, 10, 2368, 2448, 9, 7, 2695, 20, 2, 1, 1, 31, 18, 2, 1, 9, 3596, 52, 10, 1, 1, 1, 5, 4300, 2, 74, 4624 (list; graph; listen)
OFFSET

1,1

EXAMPLE

The first 8 composites are 4,6,8,9,10,12,14,15. 4+6+8+9+10+12+14+15 = 78 = 2*3*13. So a(8) = GCD(2*3*13, 4*6*8*9*10*12*14*15) = 6.

CROSSREFS

Cf. A053767, A036691.

Sequence in context: A019104 A019119 A019181 this_sequence A019182 A019105 A087056

Adjacent sequences: A132993 A132994 A132995 this_sequence A132997 A132998 A132999

KEYWORD

nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Nov 22 2007

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 13 2008

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research