The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049239 Smallest nonnegative value taken on by px^2-qy^2 for an infinite number of integer pairs (x,y), where (p,q) = (1,1), (1,2), (2,1), (1,3), (2,2), (3,1)... 0
 0, 1, 1, 1, 0, 2, 0, 2, 1, 0, 1, 2, 0, 2, 1, 1, 2, 3, 1, 2, 2, 1, 2, 3, 0, 2, 4, 3, 1, 1, 3, 4, 1, 3, 5, 4, 0, 0, 3, 4, 0, 2, 1, 0, 0, 1, 2, 3, 1, 5, 1, 3, 5, 1, 1, 1, 2, 3, 4, 5, 0, 2, 4, 6, 2, 2, 1, 2, 2, 0, 5, 6, 1, 3, 0, 7, 1, 3, 1, 2, 1, 4, 5, 6, 0, 2, 1, 4, 8, 4, 1, 1, 2, 0, 1, 5, 6, 7, 1, 3, 5, 7, 0, 2, 5 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 LINKS Table of n, a(n) for n=1..105. EXAMPLE Array begins: 0, 1, 1, 0, 1, ... 1, 0, 2, 2, 2, ... 2, 1, 0, 3, 3, ... 0, 2, 1, 0, 4, ... 1, 2, 2, 1, 0, ... ... MATHEMATICA f[p_, q_, z_] := FindInstance[x > 0 && y > 0 && p*x^2 - q*y^2 == z, {x, y}, Integers, 1]; a[p_, q_] := For[z = 0, True, z = z + GCD[p, q], fz = f[p, q, z]; If[fz =!= {}, Print["a(", p, " ", q, ") = ", z, " {x, y} = ", {x, y} /. fz[[1]]]; Return[z]]]; Table[TimeConstrained[a[p - q + 1, q], 300], {p, 1, 14}, {q, p, 1, -1}] // Flatten (* Jean-François Alcover, Oct 10 2016 *) CROSSREFS Sequence in context: A193680 A186809 A112300 * A194305 A036580 A101674 Adjacent sequences: A049236 A049237 A049238 * A049240 A049241 A049242 KEYWORD nonn,tabl AUTHOR David W. Wilson 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 July 15 12:56 EDT 2024. Contains 374332 sequences. (Running on oeis4.)