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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054641 GCD of divisor-sum of primorials and primorials itself = GCD[A002110(n), A000203(A002110(n))]. 2
1, 6, 6, 6, 6, 42, 42, 210, 210, 210, 210, 3990, 3990, 43890, 43890, 43890, 43890, 1360590, 23130030, 23130030, 855811110, 855811110, 855811110, 855811110, 855811110, 855811110, 11125544430, 11125544430, 11125544430, 11125544430 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

1. Values are repeated for several arguments: observed from 1 to 8 times below n=100. Sites of jump seems not so regular. 2. From a sufficiently high value of n, A002110(n) divides the terms. E.g. from n=27, A002110(8) divides the values of this sequences.

CROSSREFS

A002110, A000203, A028815, A054640, A054642.

Sequence in context: A173067 A092937 A116571 * A024731 A195504 A098537

Adjacent sequences:  A054638 A054639 A054640 * A054642 A054643 A054644

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 13 13:22 EST 2012. Contains 205483 sequences.