Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116891
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116891 GCD(n!+1,n^n+1). +0
4
2, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 191, 1, 1, 1, 199, 1, 1 (list; graph; listen)
OFFSET

1,1

COMMENT

Apparently all the values greater than 1 (cf. A116892) are prime numbers and are equal to 2n+1 with only 4 exceptions for n<82000 (cf. A116894).

EXAMPLE

a(3)=GCD(3!+1,3^3+1)=GCD(7,28)=7.

MATHEMATICA

Table[GCD[n! + 1, n^n + 1], {n, 101}] (from Robert G. Wilson v (rgwv(at)rgwv.com), Mar 09 2006)

CROSSREFS

Cf. A014566, A038507, A067658, A116892, A116893, A116894.

Sequence in context: A004561 A051258 A063704 this_sequence A079620 A010254 A117044

Adjacent sequences: A116888 A116889 A116890 this_sequence A116892 A116893 A116894

KEYWORD

easy,nonn

AUTHOR

Giovanni Resta (g.resta(AT)iit.cnr.it), Mar 01 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research