Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054642
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054642 Distinct values of GCD of divisor sum of primorials and primorial itself: GCD[A002110(n), A000203(A002110(n))]. +0
2
1, 6, 42, 210, 3990, 43890, 1360590, 23130030, 855811110, 11125544430, 255887521890, 20215114229310, 828819683401710, 24035770818649590, 2331469769409010230, 123567897778677542190, 5313419604483134314170 (list; graph; listen)
OFFSET

1,2

COMMENT

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: A082986 A062136 A047663 this_sequence A082139 A054613 A141834

Adjacent sequences: A054639 A054640 A054641 this_sequence A054643 A054644 A054645

KEYWORD

nonn

AUTHOR

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

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research