Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067663
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067663 Sequence gives values of GCD(k!+1,k^k-1) when not equal to 1. +0
1
2, 3, 5, 11, 7, 19, 11, 13, 17, 19, 43, 23, 401, 29, 31, 67, 37, 41, 43, 47, 53, 59, 61, 131, 67, 71, 73, 79, 163, 83, 89, 179, 97, 101, 103, 107, 109, 113, 227, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 347, 179, 181, 191, 193, 197, 199, 419, 211, 443, 223 (list; graph; listen)
OFFSET

1,1

COMMENT

Sequence appears to contain each prime number once or twice.

FORMULA

For some even k : GCD(k!+1, k^k-1)=k+1 for some odd k : GCD(k!+1, k^k-1)=2*k+1 but for k=25 GCD(k!+1, k^k-1)=16*k+1 or k=788 GCD(k!+1, k^k-1)=6*k+1

CROSSREFS

Sequence in context: A101595 A084331 A084333 this_sequence A112037 A087583 A111214

Adjacent sequences: A067660 A067661 A067662 this_sequence A067664 A067665 A067666

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 03 2002

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 December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research