Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116892
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116892 Values of GCD(n!+1,n^n+1), when greater than 1. +0
4
2, 7, 47, 79, 103, 127, 191, 199, 263, 367, 383, 431, 479, 503, 599, 607, 631, 727, 743, 823, 839, 863, 887, 991, 1087, 1151, 1319, 1367, 1423, 1487, 1511, 1583, 1663, 1783, 1823, 1871, 1951, 2039, 2063, 2111, 2143, 2287, 2311, 2383, 2423, 2447, 2503, 2551 (list; graph; listen)
OFFSET

1,1

COMMENT

Apart from the initial term (2) and few exceptional values (A116894) this sequence seems to coincide with A067658. The values of n for which the terms of this series are attained are in A116893.

EXAMPLE

GCD(1!+1,1^1+1)=2 gives the first term, GCD(3!+1,3^3+1)=GCD(7,28)=7 gives the second and so on.

MATHEMATICA

f[n_] := GCD[n! + 1, n^n + 1]; t = Array[f, 1295]; Rest@ Union@ t (from Robert G. Wilson v (rgwv(at)rgwv.com), Mar 09 2006)

CROSSREFS

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

Sequence in context: A111842 A027458 A062632 this_sequence A054555 A072287 A091117

Adjacent sequences: A116889 A116890 A116891 this_sequence A116893 A116894 A116895

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

Entries checked by Robert G. Wilson v (rgwv(at)rgwv.com), Mar 09 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