A003654 -id:A003654 - cp's OEIS frontend

A249021 Value x in the solution of x^2-D*y^2=-1 as D runs through A003654.

7, 38, 117, 18, 268, 515, 70, 882, 32, 182, 99, 29718, 2072, 1068, 43, 2943, 378, 500, 5604, 4030, 4005, 8890182, 776, 5357, 57, 1744, 6948, 113582, 4832118, 8827, 1118, 1111225770, 68, 1764132, 11018, 3141, 251, 13545, 1710, 23156, 71011068, 16432, 6072, 82, 1407, 8920484118, 1063532, 19703

Offset: 1

R. J. Mathar, Oct 19 2014

nonn

The pair (x,y) is taken from the numerator of the earliest (lowest order) convergent to the continued fraction of sqrt(D) that satisfies the "non-Pell" equation.

Cf. A130226.

A249021 := proc(n)
    local dis,cf,o,q,x,y ;
    dis := A003654(n) ;
    cf := numtheory[cfrac](sqrt(dis),'periodic','quotients') ;
    for o from 1 do
        q := numtheory[nthconver](cf,o) ;
        x := numer(q) ;
        y := denom(q) ;
        if x^2-dis*y^2 = -1 then
            return x ;
        end if;
    end do:
end proc:
seq(A249021(n),n=1..50) ;

A003814 Numbers k such that the continued fraction for sqrt(k) has odd period length.

Original entry on oeis.org

2, 5, 10, 13, 17, 26, 29, 37, 41, 50, 53, 58, 61, 65, 73, 74, 82, 85, 89, 97, 101, 106, 109, 113, 122, 125, 130, 137, 145, 149, 157, 170, 173, 181, 185, 193, 197, 202, 218, 226, 229, 233, 241, 250, 257, 265, 269, 274, 277, 281, 290, 293, 298, 313, 314, 317

Offset: 1

N. J. A. Sloane, Walter Gilbert

nonn

All primes of the form 4m + 1 are here. - T. D. Noe, Mar 19 2012
These numbers have no prime factors of the form 4m + 3. - Thomas Ordowski, Jul 01 2013
This sequence is a proper subsequence of the so-called 1-happy number products A007969. See the W. Lang link there, eq. (1), with B = 1, C = a(n), also with a table at the end. This is due to the soluble Pell equation R^2 - C*S^2 = -1 for C = a(n). See e.g., Perron, Satz 3.18. on p. 93, and the table on p. 91 with the numbers D of the first column that do not have a number in brackets in the second column (Teilnenner von sqrt(D)). - Wolfdieter Lang, Sep 19 2015

W. Paulsen, Calkin-Wilf sequences for irrational numbers, Fib. Q., 61:1 (2023), 51-59.
O. Perron, Die Lehre von den Kettenbrüchen, Band I, Teubner Verlagsgesellschaft, Stuttgart, 1954.
Kenneth H. Rosen, Elementary Number Theory and Its Applications, Addison-Wesley, 1984, page 426 (but beware of errors!).

Ray Chandler, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)
S. R. Finch, Class number theory [Cached copy, with permission of the author]
P. J. Rippon and H. Taylor, Even and odd periods in continued fractions of square roots, Fibonacci Quarterly 42, May 2004, pp. 170-180.

Cf. A010333, A003654, A007969.
Cf. A031396.
Cf. A206586 (period has positive even length).

isA003814 := proc(n)
    local cf,p ;
    if issqr(n) then
        return false;
    end if;
    for p in numtheory[factorset](n) do
        if modp(p,4) = 3 then
            return false;
        end if;
    end do:
    cf := numtheory[cfrac](sqrt(n),'periodic','quotients') ;
    type( nops(op(2,cf)),'odd') ;
end proc:
A003814 := proc(n)
    option remember;
    if n = 1 then
        2;
    else
        for a from procname(n-1)+1 do
            if isA003814(a) then
                return a;
            end if;
        end do:
    end if;
end proc:
seq(A003814(n),n=1..40) ; # R. J. Mathar, Oct 19 2014

Select[Range[100], ! IntegerQ[Sqrt[#]] && OddQ[Length[ContinuedFraction[Sqrt[#]][[2]]]] &] (* T. D. Noe, Mar 19 2012 *)

cyc(cf) = {
  if(#cf==1, return([])); \\ There is no cycle
  my(s=[]);
  for(k=2, #cf,
    s=concat(s, cf[k]);
    if(cf[k]==2*cf[1], return(s)) \\ Cycle found
  );
  0 \\ Cycle not found
}
select(n->#cyc(contfrac(sqrt(n)))%2==1, vector(400, n, n)) \\ Colin Barker, Oct 19 2014

A172000 Nonsquare positive integers n such that the fundamental unit of quadratic field Q(sqrt(n)) has norm -1.

Original entry on oeis.org

2, 5, 8, 10, 13, 17, 18, 20, 26, 29, 32, 37, 40, 41, 45, 50, 52, 53, 58, 61, 65, 68, 72, 73, 74, 80, 82, 85, 89, 90, 97, 98, 101, 104, 106, 109, 113, 116, 117, 122, 125, 128, 130, 137, 145, 148, 149, 153, 157, 160, 162, 164, 170, 173, 180, 181, 185, 193, 197, 200

Offset: 1

Max Alekseyev, Jan 21 2010

nonn

Complement of A087643 in the nonsquare integers A000037.
Subsequence of A000415, their set difference form A172001.
Contains A003814 as a subsequence, their squarefree terms coincide and form A003654.
It seems that this sequence also gives the values of n such that the equation x^2 - n*y^2 = n has integer solutions. - Colin Barker, Aug 20 2013

cr = {}; Do[If[IntegerQ[Sqrt[n]], , kk = NumberFieldFundamentalUnits[Sqrt[n]]; d1 = kk[[1]][[2]][[1]]; d2 = kk[[1]][[1]] kk[[1]][[2]][[2]]; d3 = Expand[(d1 + d2) (d1 - d2)]; If[d3 == -1, AppendTo[cr, n]]], {n, 2, 1000}]; cr (* Artur Jasinski, Oct 10 2011 *)

{ for(n=1,1000, if(issquare(n),next); if( norm(bnfinit(x^2-n).fu[1])==-1, print1(n,", ")) ) }

A positive integer n is in this sequence iff its squarefree core A007913(n) belongs to A003654.

Edited by Max Alekseyev, Mar 09 2010

A020893 Squarefree sums of two squares; or squarefree numbers with no prime factors of the form 4k+3.

Original entry on oeis.org

1, 2, 5, 10, 13, 17, 26, 29, 34, 37, 41, 53, 58, 61, 65, 73, 74, 82, 85, 89, 97, 101, 106, 109, 113, 122, 130, 137, 145, 146, 149, 157, 170, 173, 178, 181, 185, 193, 194, 197, 202, 205, 218, 221, 226, 229, 233, 241, 257, 265, 269, 274, 277, 281, 290, 293, 298, 305, 313, 314, 317, 337, 346, 349

Offset: 1

Steven Finch

nonn

Primitively but not imprimitively represented by x^2 + y^2.
The disjoint union of {1}, A003654, and A031398. - Max Alekseyev, Mar 09 2010
Squarefree members of A202057. - Artur Jasinski, Dec 10 2011
Union of A231754 and 2*A231754. Squarefree numbers whose prime factors are in A002313. - Robert Israel, Aug 23 2017
It appears that a(n) is the n-th index, k, such that f(k) = 2, where f(k) = 3*(Sum_{i=1..k} floor(i^2/k)) - k^2 (see A175908). - John W. Layman, May 16 2011

Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988; see page 123.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Steven R. Finch, On a Generalized Fermat-Wiles Equation [broken link]
Steven R. Finch, On a Generalized Fermat-Wiles Equation [From the Wayback Machine]
Index entries for sequences related to sums of squares

Cf. A001481, A008784, A022544, A034023, A175908.

Cf. also A000290, A010052, A005117, A084349, A002313, A231754.

a020893 n = a020893_list !! (n-1)
a020893_list = filter (\x -> any (== 1) $ map (a010052 . (x -)) $
                             takeWhile (<= x) a000290_list) a005117_list
-- Reinhard Zumkeller, May 28 2015

N:= 1000: # to get all terms <= N
R:= {1,2}:
p:= 2:
do
p:= nextprime(p);
if p > N then break fi;
if p mod 4 <> 1 then next fi;
R:= R union select(`<=`,map(`*`,R,p),N);
od:
sort(convert(R,list)); # Robert Israel, Aug 23 2017

lim = 17; t = Join[{1}, Select[Union[Flatten[Table[x^2 + y^2, {x, lim}, {y, x}]]], # < lim^2 && SquareFreeQ[#] &]]
Select[Union[Total/@Tuples[Range[0,20]^2,2]],SquareFreeQ] (* Harvey P. Dale, Jul 26 2017 *)
Block[{nn = 350, p}, p = {1, 2}~Join~Select[Prime@ Range@ PrimePi@ nn, Mod[#, 4] == 1 &]; Select[Range@ nn, And[SquareFreeQ@ #, SubsetQ[p, FactorInteger[#][[All, 1]]]] &]] (* Michael De Vlieger, Aug 23 2017 *)
(* or *)
Select[Range[350], SquareFreeQ@ # && ! MemberQ[Mod[First /@ FactorInteger@ #, 4], 3] &] (* Giovanni Resta, Aug 25 2017 *)

is(n)=my(f=factor(n)); for(i=1,#f~,if(f[i,2]>1 || f[i,1]%4==3, return(0))); 1 \\ Charles R Greathouse IV, Apr 20 2015

from itertools import count, islice
from sympy import factorint
def A020893_gen(): # generator of terms
    return filter(lambda n:all(p & 3 != 3 and e == 1 for p, e in factorint(n).items()),count(1))
A020893_list = list(islice(A020893_gen(),30)) # Chai Wah Wu, Jun 28 2022

a(n) ~ k*n*sqrt(log n), where k = 2.1524249... = A013661/A064533. - Charles R Greathouse IV, Apr 20 2015

Edited by N. J. A. Sloane, Aug 30 2017

A077232 a(n) is smallest natural number satisfying Pell equation a^2 - d(n)*b^2= +1 or = -1, with d(n)=A000037(n) (a nonsquare). Corresponding smallest b(n)=A077233(n).

Original entry on oeis.org

1, 2, 2, 5, 8, 3, 3, 10, 7, 18, 15, 4, 4, 17, 170, 9, 55, 197, 24, 5, 5, 26, 127, 70, 11, 1520, 17, 23, 35, 6, 6, 37, 25, 19, 32, 13, 3482, 199, 161, 24335, 48, 7, 7, 50, 649, 182, 485, 89, 15, 151, 99, 530, 31, 29718, 63, 8, 8, 65, 48842, 33, 7775, 251, 3480, 17, 1068, 43, 26, 57799, 351, 53, 80, 9, 9, 82, 55, 378, 10405, 28, 197, 500, 19, 1574, 1151, 12151, 2143295, 39, 49, 5604, 99, 10, 10, 101, 227528

Offset: 1

Wolfdieter Lang, Nov 08 2002

If d(n)=A000037(n) is from A003654 (that is if the regular continued fraction for sqrt(d(n)) has odd (primitive) period length) then the -1 option applies. For such d(n) the minimal a(n) and b(n) numbers for the +1 option are 2*a(n)^2+1 and 2*a(n)*b(n), respectively (see Perron I, pp. 94,95).
If d(n)=A000037(n)= k^2+1, k=1,2,.., then the a^2 - d(n)*b^2 = -1 Pell equation has the minimal solution a(n)=k and b(n)=1. If d(n)=A000037(n)= k^2-1, k=2,3,..., then the a^2 - d(n)*b^2 = +1 Pell equation has the minimal solution a=k and b=1.
The general integer solutions (up to signs) of Pell equation a^2 - d(n)*b^2 = +1 with d(n)=A000037(n), but not from A003654, are a(n,p)= T(p+1,a(n)) and b(n,p)= b(n)*S(p,2*a(n)), p=0,1,... If d(n)=A000037(n) is also from A003654 then these solutions are a(n,p)= T(p+1,2*a(n)^2+1) and b(n,p)= 2*a(n)*b(n)*S(p,2*(2*a(n)^2+1)), p=0,1,... Here T(n,x), resp. S(n,x) := U(n,x/2), are Chebyshev's polynomials of the first, resp. second, kind. See A053120 and A049310.
The general integer solutions (up to signs) of the Pell equation a^2 - d(n)*b^2 = -1 with d(n)=A000037(n)= A003654(k), for some k>=1, are a(n,p) = a(n)*(S(n,2*(2*a(n)^2)+1) + S(n-1,2*(2*a(n)^2)+1)) and b(n,p) = b(n)*(S(n,2*(2*a(n)^2)+1) - S(n-1,2*(2*a(n)^2)+1)) with the S(n,x) := U(n,x/2) Chebyshev polynomials. S(-1,x) := 0.
If the trivial solution x=1, y=0 is included, the sequence becomes A006702. - T. D. Noe, May 17 2007

			d=10=A000037(7)=A003654(3), therefore a(7)^2=10*b(7)^2 -1, i.e. 3^2=10*1^2 -1 and 2*a(7)^2+1=19 and 2*a(7)*b(7)=2*3*1=6 satisfy 19^2 - 10*6^2 = +1.
d=11=A000037(8) is not in A003654, therefore there is no (nontrivial) solution of the a^2 - d*b^2 = -1 Pell equation and a(8)=10 and b(8)=A077233(8)=3 satisfy 10^2 - 11*3^2 = +1.
10=d(7)=A000037(7)=A003654(3)=3^2+1 hence a(7)=3 and b(7)=1 are the smallest numbers satisfying a^2-10*b^2=-1.
8=d(6)=A000037(6)=3^2-1 (not in A003654) hence a(6)=3 and b(6)=1 are the smallest numbers satisfying a^2-8*b^2=+1.

T. Nagell, "Introduction to Number Theory", Chelsea Pub., New York, 1964, table p. 301.
O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 26, p. 91 with explanation on pp. 94,95).

Ray Chandler, Table of n, a(n) for n = 1..10000
A. M. Legendre, Fractions les plus simples m/n qui satisfont à l'équation m^2 - an^2 =+-1 pour tout nombre non quarré a depuis 2 jusqu'à 1003, Essai sur la Théorie des Nombres An VI, Table XII. [_Paul Curtz_, Apr 10 2019]
Index entries for sequences related to Chebyshev polynomials.

Cf. A000037, A003654, A003814, A006702, A033313, A077233.

nmax = 500;
nconv = 200; (* The number of convergents 'nconv' should be increased if the linear recurrence is not found for some terms. *)
nonSquare[n_] := n + Round[Sqrt[n]];
a[n_] := a[n] = Module[{lr}, lr = FindLinearRecurrence[ Numerator[ Convergents[ Sqrt[nonSquare[n]], nconv]]]; (1/2) SelectFirst[lr, #>1&]];
Table[Print[n, " ", a[n]]; a[n], {n, 1, nmax}] (* Jean-François Alcover, Mar 10 2021 *)

a(n)=sqrt(A000037(n)*A077233(n)^2 + (-1)^(c(n))) with c(n)=1 if A000037(n)=A003654(k) for some k>=1 else c(n)=0.

A031398 Squarefree n with no 4k+3 factors such that Pell equation x^2 - n y^2 = -1 is insoluble.

Original entry on oeis.org

34, 146, 178, 194, 205, 221, 305, 377, 386, 410, 466, 482, 505, 514, 545, 562, 674, 689, 706, 745, 793, 802, 866, 890, 898, 905, 1154, 1186, 1202, 1205, 1234, 1282, 1345, 1346, 1394, 1405, 1469, 1513, 1517, 1537, 1538, 1717, 1762, 1802, 1858

Offset: 1

David W. Wilson

nonn

Or, numbers n which are the sum of two relatively-prime squares but for which x^2 - n*y^2 does not represent -1.

Together with {1} and A003654 forms a disjoint partition of A020893. That is, A020893 = {1} U A003654 U A031398. - Max Alekseyev, Mar 09 2010

Harvey Cohn, "Advanced Number Theory".

Jean-François Alcover, Table of n, a(n) for n = 1..1000
Janis Kuzmanis, A simple solvability criterion for the negative Pell equation, hal-02502164, Mathematics [math] / Number Theory [math.NT], (2020).
K. Lakshmi, R. Someshwari, On The Negative Pell Equation y^2 = 72x^2 - 23, International Journal of Emerging Technologies in Engineering Research (IJETER), Volume 4, Issue 7, July (2016).
J. P. Robertson and K. R. Matthews, A continued fraction approach to a result of Feit, Amer. Math. Monthly, 115 (No. 4, 2008), 346-349.
R. Suganya, D. Maheswari, On the Negative Pellian Equation y^2 = 110 * x^2 - 29, Journal of Mathematics and Informatics, Vol. 11 (2017), pp. 63-71.
S. Vidhyalakshmi, V. Krithika, K. Agalya, On The Negative Pell Equation y^2 = 72x^2 - 8, International Journal of Emerging Technologies in Engineering Research (IJETER) 4:2 (2016).

Cf. A031396, A031397.

sel = Select[Range[2000], SquareFreeQ[#] && FreeQ[Mod[FactorInteger[#][[All, 1]], 4], 3]&]; r[n_] := Reduce[x^2-n*y^2 == -1, {x, y}, Integers]; Reap[For[n=1, n <= Length[sel], n++, an = sel[[n]]; If[r[an] === False, Print[an]; Sow[an]]]][[2, 1]] (* Jean-François Alcover, Feb 04 2014 *)

Edited by N. J. A. Sloane, Apr 28 2008, at the suggestion of Artur Jasinski

A077233 a(n) is smallest natural number satisfying Pell equation b^2- d(n)*a^2= +1 or = -1, with d(n)=A000037(n) (nonsquare). Corresponding smallest b(n)=A077232(n).

Original entry on oeis.org

1, 1, 1, 2, 3, 1, 1, 3, 2, 5, 4, 1, 1, 4, 39, 2, 12, 42, 5, 1, 1, 5, 24, 13, 2, 273, 3, 4, 6, 1, 1, 6, 4, 3, 5, 2, 531, 30, 24, 3588, 7, 1, 1, 7, 90, 25, 66, 12, 2, 20, 13, 69, 4, 3805, 8, 1, 1, 8, 5967, 4, 936, 30, 413, 2, 125, 5, 3, 6630, 40, 6, 9, 1, 1, 9, 6, 41, 1122, 3, 21, 53, 2, 165, 120, 1260, 221064, 4, 5, 569, 10, 1, 1, 10, 22419

Offset: 1

Wolfdieter Lang, Nov 08 2002

If d(n)=A000037(n) is from A003654 (that is if the regular continued fraction for sqrt(d(n)) has odd (primitive) period length) then the -1 option applies. For such d(n) the minimal b(n) and a(n) numbers for the +1 option are 2*b(n)^2 + 1 and 2*b(n)*a(n), respectively (see Perron I, pp. 94,p5).
For general integer solutions see A077232 comments.
If the trivial solution x=1, y=0 is included, the sequence becomes A006703. - T. D. Noe, May 17 2007

			d=10=A000037(7)=A003654(3), therefore a(7)=1 and b(7)=A077232(7)=3 give 3^2=10*1^2 -1 and 2*b(7)^2+1=19 and 2*b(7)*a(7)=2*3*1=6 satisfy 19^2 - 10*6^2 = +1.
d=11=A000037(8) is not in A003654, therefore there is no (nontrivial) solution of the b^2 - d*a^2 = -1 Pell equation and a(8)=3 and b(8)=A077232(8)=10 satisfy 10^2 - 11*3^2 = +1. See A077232 for further examples.

T. Nagell, "Introduction to Number Theory", Chelsea Pub., New York, 1964, table p. 301.
O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 26, p. 91 with explanation on pp. 94,95).

Ray Chandler, Table of n, a(n) for n = 1..10000
A. M. Legendre, Fractions les plus simples m/n qui satisfont à l'équation m^2 - an^2 =+-1 pour tout nombre non quarré a depuis 2 jusqu'à 1003, Essai sur la Théorie des Nombres An VI, Table XII. [_Paul Curtz_, Apr 10 2019]

Cf. A000037, A003654, A003814, A033317, A077232.

nmax = 500;
nconv = 200; (* The number of convergents 'nconv' should be increased if the linear recurrence is not found for some terms. *)
nonSquare[n_] := n + Round[Sqrt[n]];
b[n_] := b[n] = Module[{lr}, lr = FindLinearRecurrence[ Numerator[ Convergents[ Sqrt[nonSquare[n]], nconv]]]; (1/2) SelectFirst[lr, #>1&]];
a[n_] := If[n == 1, 1, SelectFirst[{Sqrt[(b[n]^2 - 1)/nonSquare[n]], Sqrt[(b[n]^2 + 1)/nonSquare[n]]}, IntegerQ]];
Table[Print[n, " ", a[n]]; a[n], {n, 1, nmax}] (* Jean-François Alcover, Mar 10 2021 *)

a(n)=sqrt((A077232(n)^2 - (-1)^(c(n)))/A000037(n)) with c(n)=1 if A000037(n)=A003654(k) for some k>=1 else c(n)=0.

A031397 Nonsquarefree n such that Pell equation x^2 - n y^2 = -1 is soluble.

Original entry on oeis.org

50, 125, 250, 325, 338, 425, 845, 925, 1025, 1250, 1325, 1445, 1450, 1525, 1625, 1682, 1825, 1850, 2050, 2125, 2197, 2425, 2725, 2738, 2825, 2873, 2890, 3050, 3125, 3250, 3425, 3625, 3725, 3925, 4250, 4325, 4394, 4625, 4825, 4901, 4913

Offset: 1

David W. Wilson

nonn

Harvey Cohn, Advanced Number Theory, Dover Publications, New York, N.Y. (1980).
S Vidhyalakshmi, V Krithika, K Agalya, On The Negative Pell Equation, International Journal of Emerging Technologies in Engineering Research (IJETER), Volume 4, Issue 2, February (2016) www.ijeter.everscience.org,

Giovanni Resta, Table of n, a(n) for n = 1..10000 (first 500 terms from Robert Israel)

Equals {A003814} minus {A003654}, cf. A031396.

filter:= t -> not numtheory:-issqrfree(t) and [isolve(x^2 - t*y^2 = -1)]<>[]:
select(filter, [$1..10000]); # Robert Israel, Jul 10 2018

r[n_] := Reduce[x>0 && y>0 && x^2 - n y^2 == -1, {x, y}, Integers];
Reap[For[n = 1, n <= 5000, n++, If[!SquareFreeQ[n], If[r[n] =!= False, Print[n]; Sow[n]]]]][[2, 1]] (* Jean-François Alcover, Mar 05 2019 *)

Offset changed by Robert Israel, Jul 10 2018

A062769 Smallest number m such that the continued fraction expansion of sqrt(m) has period 2n + 1.

Original entry on oeis.org

2, 41, 13, 58, 106, 61, 193, 109, 157, 337, 181, 586, 457, 949, 821, 601, 613, 1061, 421, 541, 1117, 1153, 1249, 1069, 1021, 1201, 1669, 2381, 1453, 2137, 2053, 1801, 2293, 1381, 1549, 3733, 3541, 3217, 5857, 1621, 3169, 4657, 2689, 3049, 2389, 4057, 4549

Offset: 0

Lekraj Beedassy, Jul 17 2001

nonn

If the continued fraction for sqrt(N) has period (2k + 1) and k-th convergent P(k)/Q(k) [taking P(-1)=1; Q(-1)=0 where necessary], then the i-th positive solution V(i) = [x(i),y(i)] to the Pell equation x^2 - N*y^2 = 1 satisfies the recurrence V(i+2) = 2*A*V(i+1) - V(i) starting with V(0)=(1,0); V(1) = (A,B) where A = 2*S^2 + 1; B = 2*S*T and S = P(k)*Q(k) + P(k-1)*Q(k-1); T = Q(k)^2 + Q(k-1)^2.

			For n = 2, 2n+1 = 5. a(2) = 13 and we indeed have sqrt(13) = [3; 1, 1, 1, 1, 6] with period 5, the first one in the sequence sqrt(29) = [5; 2, 1, 1, 2, 10], sqrt(53) = [7; 3, 1, 1, 3, 14], sqrt(74) = [8; 1, 1, 1, 1, 16], sqrt(85) = [9; 4, 1, 1, 4, 18], sqrt(89) = [9; 2, 3, 3, 2, 18], ...

Michael De Vlieger, Table of n, a(n) for n = 0..1000 (Terms 0..999 from T. D. Noe)
Dario Alpern, Continued Fraction calculator.
Keith Matthews, Calculating the simple continued fraction of a quadratic irrational.
Ulrich Sondermann, Continued Fractions.
Gang Xiao, Contfrac,continued fraction expansion server with k-th convergent calculator.

Cf. A013646, A003814, A031396, A003654.

nn = 50; t = Table[0, {nn}]; n = 1; found = 0; While[found < nn, n++; If[! IntegerQ[Sqrt[n]], c = ContinuedFraction[Sqrt[n]]; len = Length[c[[2]]]; If[OddQ[len] && (len + 1)/2 <= nn && t[[(len + 1)/2]] == 0, t[[(len + 1)/2]] = n; found++]]]; t (* T. D. Noe, Apr 04 2014 *)

More terms from Naohiro Nomoto, Jan 01 2002

A202155 x-values in the solution to x^2 - 13*y^2 = -1.

Original entry on oeis.org

18, 23382, 30349818, 39394040382, 51133434066018, 66371158023650982, 86149711981264908618, 111822259780523827735182, 145145207045407947135357618, 188398366922679734857866452982, 244540935120431250437563520613018, 317413945387952840388222591889244382

Offset: 1

Bruno Berselli, Dec 15 2011

The corresponding values of y of this Pell equation are in A202156.

A. H. Beiler, Recreations in the Theory of Numbers: The Queen of Mathematics Entertains, Dover (New York), 1966, p. 264.

Bruno Berselli, Table of n, a(n) for n = 1..200
Tanya Khovanova, Recursive Sequences.
A. M. S. Ramasamy, Polynomial solutions for the Pell's equation, Indian Journal of Pure and Applied Mathematics 25 (1994), p. 579 (Theorem 4, case t=1).
J. P. Robertson, Solving the generalized Pell equation x^2-D*y^2=N, pp. 9, 24.
Index entries for linear recurrences with constant coefficients, signature (1298,-1).

Cf. A002313, A003654, A031396, A114047, A202156.

m:=13; R:=PowerSeriesRing(Integers(), m); Coefficients(R!(18*x*(1+x)/(1-1298*x+x^2)));

LinearRecurrence[{1298, -1}, {18, 23382}, 12]

makelist(expand(((18+5*sqrt(13))^(2*n-1)+(18-5*sqrt(13))^(2*n-1))/2), n, 1, 12);

G.f.: 18*x*(1+x)/(1-1298*x+x^2).

a(n) = -a(-n+1) = (r^(2n-1)-1/r^(2n-1))/2, where r=18+5*sqrt(13).

cp's OEIS Frontend

A249021 Value x in the solution of x^2-D*y^2=-1 as D runs through A003654.

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

A003814 Numbers k such that the continued fraction for sqrt(k) has odd period length.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

A172000 Nonsquare positive integers n such that the fundamental unit of quadratic field Q(sqrt(n)) has norm -1.

Views

Author

Keywords

Comments

Programs

Mathematica

PARI

Formula

Extensions

A020893 Squarefree sums of two squares; or squarefree numbers with no prime factors of the form 4k+3.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Formula

Extensions

A077232 a(n) is smallest natural number satisfying Pell equation a^2 - d(n)*b^2= +1 or = -1, with d(n)=A000037(n) (a nonsquare). Corresponding smallest b(n)=A077233(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A031398 Squarefree n with no 4k+3 factors such that Pell equation x^2 - n y^2 = -1 is insoluble.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Extensions

A077233 a(n) is smallest natural number satisfying Pell equation b^2- d(n)*a^2= +1 or = -1, with d(n)=A000037(n) (nonsquare). Corresponding smallest b(n)=A077232(n).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs