The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A200514 Least m>0 such that n = y^2 - 4^x (mod m) has no solution, or 0 if no such m exists. 1
 0, 3, 4, 0, 3, 0, 4, 3, 0, 0, 3, 16, 0, 3, 4, 0, 3, 0, 4, 3, 0, 0, 3, 16, 0, 3, 4, 16, 3, 40, 4, 3, 0, 0, 3, 0, 0, 3, 4, 16, 3, 63, 4, 3, 63, 0, 3, 20, 0, 3, 4, 20, 3, 40, 4, 3, 80, 0, 3, 16, 0, 3, 4, 0, 3, 0, 4, 3, 0, 40, 3, 16, 80, 3, 4, 16, 3, 0, 4, 3, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS To prove that an integer n is in A051206, it is sufficient to find integers x,y such that y^2 - 4^x=n. In that case, a(n)=0. To prove that n is *not* in A051206, it is sufficient to find a modulus m for which the (finite) set of all possible values of 4^x and y^2 (mod m) allows us to deduce that y^2 - 4^x can never equal n. The present sequence lists the smallest such m>0, if it exists. LINKS M. F. Hasler, Table of n, a(n) for n = 0..688 EXAMPLE See A200512. PROG (PARI) A200514(n, b=4, p=3)={ my( x=0, qr, bx, seen ); for( m=3, 9e9, while( x^p < m, issquare(b^x+n) & return(0); x++); qr=vecsort(vector(m, y, y^2-n)%m, , 8); seen=0; bx=1; until( bittest(seen+=1<bx & break; next(3))); return(m))} CROSSREFS Cf. A051204-A051221, A200505-A200520. Sequence in context: A354520 A189916 A025278 * A063405 A360533 A346524 Adjacent sequences: A200511 A200512 A200513 * A200515 A200516 A200517 KEYWORD nonn AUTHOR M. F. Hasler, Nov 18 2011 STATUS approved

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

Last modified May 23 18:34 EDT 2024. Contains 372765 sequences. (Running on oeis4.)