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

 

Logo

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!)
A211411 Largest m associated with n-th Pillai prime (A063980). 4
18, 18, 43, 18, 33, 63, 55, 69, 86, 101, 16, 50, 102, 165, 64, 210, 153, 225, 259, 177, 40, 247, 252, 220, 225, 122, 343, 297, 230, 303, 375, 316, 366, 74, 300, 311, 410, 463, 400, 370, 442, 188, 395, 377, 458, 426, 274, 327, 546, 334, 383, 324, 495, 498, 457, 643, 444, 553, 506, 359, 712, 502, 681, 369, 514 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

G. E. Hardy and M. V. Subbarao, A modified problem of Pillai and some related questions, Amer. Math. Monthly 109:6 (2002), pp. 554-559.

FORMULA

19 <= a(n) <= p-7 for n > 11, where p = A063980(n).

PROG

(PARI) last(p)=if(p==23, 18, my(t=Mod(1/120, p)); forstep(m=p-6, 8, -1, t/=m; if(t==-1, return(m-1))))

Pillai(p)=my(t=Mod(5040, p)); for(m=8, p-2, t*=m; if(t==-1 && p%m!=1, return(1))); 0

apply(last, select(Pillai, primes(300)))

CROSSREFS

Trivially a(n) >= A063828(n). Cf. A063980.

Sequence in context: A243097 A040307 A022352 * A298378 A299245 A050686

Adjacent sequences:  A211408 A211409 A211410 * A211412 A211413 A211414

KEYWORD

nonn

AUTHOR

Charles R Greathouse IV, Feb 10 2013

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

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