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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054642 Distinct values of GCD of divisor sum of primorials and primorial itself: GCD[A002110(n), A000203(A002110(n))]. 1
1, 6, 42, 210, 3990, 43890, 1360590, 23130030, 855811110, 11125544430, 255887521890, 20215114229310, 828819683401710, 24035770818649590, 2331469769409010230, 123567897778677542190, 5313419604483134314170 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Below n=100, 30 values arise and if high enough are divisible by large primorials. E.g. for n=1,..30 Mod[a(n),510510]= {1,6,42,210,3990,43890,339570,157080,196350,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0}

CROSSREFS

Cf. A000203, A002110, A054640, A054641.

Sequence in context: A180806 A062136 A047663 * A082139 A180286 A054613

Adjacent sequences:  A054639 A054640 A054641 * A054643 A054644 A054645

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 15 2000

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

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.