Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063980
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A063980
%S A063980 23,29,59,61,67,71,79,83,109,137,139,149,193,227,233,239,251,257,
%T A063980 269,271,277,293,307,311,317,359,379,383,389,397,401,419,431,449,
%U A063980 461,463,467,479,499,503,521,557,563,569,571,577,593,599,601,607
%N A063980 Pillai primes: p such that there exists an integer m such that m!+1 is 
               0 mod p and p is not 1 mod m.
%D A063980 G. E. Hardy and M. V. Subbarao, A modified problem of Pillai and some 
               related questions, Amer. Math. Monthly 109 (2002), no. 6, 554-559.
%H A063980 T. D. Noe, <a href="b063980.txt">Table of n, a(n) for n = 1..1000</a>
%Y A063980 Smallest m is given in A063828.
%Y A063980 Sequence in context: A108249 A045120 A097436 this_sequence A046124 A157677 
               A092518
%Y A063980 Adjacent sequences: A063977 A063978 A063979 this_sequence A063981 A063982 
               A063983
%K A063980 nonn,nice
%O A063980 1,1
%A A063980 R. K. Guy (rkg(AT)cpsc.ucalgary.ca), Sep 08 2001
%E A063980 More terms from David W. Wilson, Sep 08, 2001

    
page 1

Search completed in 0.001 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 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research