Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097455
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097455 GCD(prime(n)+1,composite(n)). +0
1
1, 4, 6, 8, 3, 2, 6, 2, 3, 2, 2, 2, 21, 22, 24, 1, 2, 1, 4, 6, 2, 1, 2, 5, 2, 2, 13, 4, 2, 2, 1, 2, 6, 7, 50, 1, 2, 2, 1, 2, 3, 2, 12, 2, 9, 8, 1, 2, 4, 23, 2, 24, 2, 3, 2, 11, 6, 16, 1, 2, 4, 1, 2, 3, 2, 6, 1, 2, 3, 2, 1, 24, 2, 11, 20, 6, 26, 1, 2, 2, 10, 1, 16, 2, 5, 4, 9, 2, 7, 8, 1, 2, 1, 4, 125 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) primecompgcd(n) = { for(x=1, n, y=gcd(prime(x)+1, composite(x)); print1(y", ") ) } \ the n-th composite composite(n) = { local(c, x); c=1; x=0; while(c <= n, x++; if(!isprime(x), c++); ); return(x) }

CROSSREFS

Sequence in context: A102133 A012760 A107648 this_sequence A021685 A071851 A083256

Adjacent sequences: A097452 A097453 A097454 this_sequence A097456 A097457 A097458

KEYWORD

nonn

AUTHOR

Cino Hilliard (hillcino368(AT)gmail.com), Aug 23 2004

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research