The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063828 Smallest m associated with n-th Pillai prime (A063980). 3
 14, 18, 15, 8, 18, 9, 23, 13, 86, 16, 16, 50, 102, 61, 64, 210, 97, 31, 9, 93, 40, 45, 63, 220, 91, 122, 35, 85, 198, 93, 128, 316, 366, 74, 300, 151, 290, 15, 400, 282, 22, 188, 167, 191, 360, 426, 274, 271, 456, 278, 229, 324, 135, 498, 189 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS T. D. Noe and Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 (first 1000 terms from Noe) 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. EXAMPLE 14!+1 = 0 mod 23, while 23 is not 1 mod 14. MATHEMATICA nn=1000; fact=1+Rest[FoldList[Times, 1, Range[nn]]]; t={}; Do[p=Prime[i]; m=2; While[m

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 00:40 EST 2020. Contains 331030 sequences. (Running on oeis4.)