login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A215696
a(n)=smallest positive k>n+2 such that k*n+1 is a square.
1
8, 12, 8, 12, 16, 20, 24, 15, 32, 36, 40, 24, 48, 52, 24, 33, 64, 68, 72, 42, 40, 84, 88, 35, 96, 100, 104, 60, 112, 56, 120, 69, 56, 132, 48, 78, 144, 148, 72, 60, 160, 72, 168, 96, 91, 180, 184, 63, 192, 196, 88, 114, 208, 212, 105, 85, 104, 228, 232, 84
OFFSET
1,1
COMMENTS
For any n and k=n+2, 1+k*n=(n+1)^2, so here we consider the case k>n+2. Cases k<n-2 are considered in A076942, A215653.
PROG
(PARI) for(n=1, 100, k=n+3; while(!issquare(1+k*n), k++); print1(k", "))
CROSSREFS
Sequence in context: A014453 A160862 A152077 * A325809 A173461 A378689
KEYWORD
nonn
AUTHOR
Zak Seidov, Aug 21 2012
STATUS
approved