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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067721 Least number k such that k (k + n) is a perfect square, or 0 if impossible. 7
 1, 0, 0, 1, 0, 4, 2, 9, 1, 3, 8, 25, 4, 36, 18, 1, 2, 64, 6, 81, 16, 4, 50, 121, 1, 20, 72, 9, 36, 196, 2, 225, 4, 11, 128, 1, 12, 324, 162, 13, 5, 400, 8, 441, 100, 3, 242, 529, 1, 63, 40, 17, 144, 676, 18, 9, 7, 19, 392, 841, 4, 900, 450, 1, 8, 16, 22, 1089, 256, 23, 2, 1225 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 COMMENTS Impossible only for 1, 2 and 4. k equals 1 when n is in A005563. k equals 2 when n is in A054000. Let k*(k+n)= c*c, gcd(n,k,c)=1 . Then primitive triples (n,k,c) are of the form : 1) n is prime. (n,k,c)=( p, (p*p-2*p+1)/4, (p*p-1)/4 ) 2) n=(c/t)*(c/t)- t*t, n is not a prime, t positive integer. (n,k,c)=( (c/t)*(c/t)- t*t, t*t, c ) [From Ctibor O. Zizka, May 04 2009] LINKS Carmine Suriano, Table of n, a(n) for n = 0..2000 EXAMPLE a(7) = 9 because 9 (7+9) = 144 = 12^2. MATHEMATICA Do[k = 1; While[ !IntegerQ[ Sqrt[ k (k + n)]], k++ ]; Print[k], {n, 5, 75} ] CROSSREFS Cf. A067632, A007913, A076942. Sequence in context: A127470 A199449 A010649 * A159899 A322550 A201531 Adjacent sequences: A067718 A067719 A067720 * A067722 A067723 A067724 KEYWORD nonn AUTHOR Robert G. Wilson v, Feb 05 2002 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 December 3 14:49 EST 2022. Contains 358534 sequences. (Running on oeis4.)