[go: up one dir, main page]

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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A130280 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A130280 a(n) = smallest integer k>1 such that n(k^2-1)+1 is a perfect square, or 0 if no such number exists.
(history; published version)
#15 by N. J. A. Sloane at Thu May 23 08:30:10 EDT 2019
STATUS

editing

approved

#14 by N. J. A. Sloane at Thu May 23 08:30:08 EDT 2019
CROSSREFS

See also A306767.

STATUS

approved

editing

#13 by Bruno Berselli at Fri May 12 05:42:10 EDT 2017
STATUS

proposed

approved

#12 by Jean-François Alcover at Fri May 12 05:16:17 EDT 2017
STATUS

editing

proposed

#11 by Jean-François Alcover at Fri May 12 05:15:27 EDT 2017
MATHEMATICA

Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 1, 800}]}] (* _Jean-François Alcover_, May 12 2017 *)

Discussion
Fri May 12 05:16
Jean-François Alcover: Updated Mma code checked against 800 terms of b-file.
#10 by Jean-François Alcover at Fri May 12 05:14:15 EDT 2017
MATHEMATICA

$MaxExtraPrecision = 100;

r[n_, c_] := Reduce[k> > 1 && j> > 1 && n*(k^2- - 1)+) + 1 == j^2, {j, k}, Integers] /. If[n <= 3, C[1] -> 2, C[1] -> 1] // c // Simplify;

a[n_] := If[rn = r[n, 0] || r[n, 1] || r[n] === , 2]; rn === False, 0, k /. {ToRules[r[n]]} // rn]} // Min];

Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 1, 200}] (* _Jean-François Alcover_, May 12 2017 *)800}]

STATUS

approved

editing

#9 by Bruno Berselli at Fri May 12 03:12:38 EDT 2017
STATUS

proposed

approved

#8 by Jean-François Alcover at Fri May 12 02:39:44 EDT 2017
STATUS

editing

proposed

#7 by Jean-François Alcover at Fri May 12 02:39:25 EDT 2017
MATHEMATICA

r[n_] := Reduce[k > >1 && j > >1 && n*(k^2 - -1) + )+1 == j^2, {j, k}, }, Integers] /. If[n <= 3, C[1] -> 2, C[1] -> 1] // Simplify;

Integers] /. If[n <= 3, C[1] -> 2, C[1] -> 1] // Simplify;

Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 1, 200}]}] (* _Jean-François Alcover_, May 12 2017 *)

#6 by Jean-François Alcover at Fri May 12 02:37:14 EDT 2017
MATHEMATICA

r[n_] := Reduce[k > 1 && j > 1 && n*(k^2 - 1) + 1 == j^2, {j, k},

Integers] /. If[n <= 3, C[1] -> 2, C[1] -> 1] // Simplify;

a[n_] := If[r[n] === False, 0, k /. {ToRules[r[n]]} // Min];

Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 1, 200}]

STATUS

approved

editing

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 19:26 EDT 2024. Contains 375545 sequences. (Running on oeis4.)