A078357 -id:A078357 - cp's OEIS frontend

A078370 a(n) = 4(n+1)n + 5.

5, 13, 29, 53, 85, 125, 173, 229, 293, 365, 445, 533, 629, 733, 845, 965, 1093, 1229, 1373, 1525, 1685, 1853, 2029, 2213, 2405, 2605, 2813, 3029, 3253, 3485, 3725, 3973, 4229, 4493, 4765, 5045, 5333, 5629, 5933, 6245, 6565, 6893, 7229, 7573, 7925, 8285, 8653, 9029

Offset: 0

Wolfdieter Lang, Nov 29 2002

This is the generic form of D in the (nontrivially) solvable Pell equation x^2 - D*y^2 = -4. See A078356, A078357.
1/5 + 1/13 + 1/29 + ... = (Pi/8)*tanh Pi [Jolley]. - Gary W. Adamson, Dec 21 2006
Appears in A054413 and A086902 in relation to sequences related to the numerators and denominators of continued fractions convergents to sqrt((2*n+1)^2 + 4), n = 1, 2, 3, ... . - Johannes W. Meijer, Jun 12 2010
(2*n + 1 + sqrt(a(n)))/2 = [2*n + 1; 2*n + 1, 2*n + 1, ...], n >= 0, with the regular continued fraction with period length 1. This is the odd case. See A087475 for the general case with the Schroeder reference and comments. For the even case see A002522.
Primes in the sequence are in A005473. - Russ Cox, Aug 26 2019
The continued fraction expansion of sqrt(a(n)) is [2n+1; {n, 1, 1, n, 4n+2}]. For n=0, this collapses to [2; {4}]. - Magus K. Chu, Aug 27 2022
Discriminant of the binary quadratic forms y^2  - x*y - A002061(n+1)*x^2. - Klaus Purath, Nov 10 2022
From Klaus Purath, Apr 08 2025: (Start)
There are no squares in this sequence. The prime factors of these terms are always of the form 4*k + 1.
All a(n) = D satisfy the Pell equation (k*x)^2 - D*(m*y)^2 = -1 for any integer n where m = (D - 3)/2. The values for k and the solutions x, y can be calculated using the following algorithm: k = sqrt(D*m^2 - 1), x(0) = 1, x(1) = 4*D*m^2 - 1, y(0) = 1, y(1) = 4*D*m^2 - 3. The two recurrences are of the form (4*D*m^2 - 2, -1).
It follows from the above that this sequence belongs to A031396. (End)

L. B. W. Jolley, "Summation of Series", Dover Publications, 1961, p. 176.

Indranil Ghosh, Table of n, a(n) for n = 0..1000
Leo Tavares, Square illustration.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Subsequence of A077426 (D values (not a square) for which Pell x^2 - D*y^2 = -4 is solvable in positive integers).
Cf. A002061, A002522, A004770, A005473, A016754.
Cf. A054413, A078356, A078357, A086902, A087475.
Subsequence of A031396.

[4*n^2+4*n+5 : n in [0..80]]; // Wesley Ivan Hurt, Aug 29 2022

Table[4 n (n + 1) + 5, {n, 0, 45}] (* or *)
Table[8 Binomial[n + 1, 2] + 5, {n, 0, 45}] (* or *)
CoefficientList[Series[(5 - 2 x + 5 x^2)/(1 - x)^3, {x, 0, 45}], x] (* Michael De Vlieger, Jan 04 2017 *)

a(n)=4*n^2+4*n+5 \\ Charles R Greathouse IV, Sep 24 2015

a= lambda n: 4*n**2+4*n+5 # Indranil Ghosh, Jan 04 2017

(1 to 99 by 2).map(n => n * n + 4) // Alonso del Arte, May 29 2019

a(n) = (2*n + 1)^2 + 4.
a(n) = 4*(n+1)*n + 5 = 8*binomial(n+1, 2) + 5, hence subsequence of A004770 (5 (mod 8) numbers). [Typo fixed by Zak Seidov, Feb 26 2012]
G.f.: (5 - 2*x + 5*x^2)/(1 - x)^3.
a(n) = 8*n + a(n-1), with a(0) = 5. - Vincenzo Librandi, Aug 08 2010
a(n) = A016754(n) + 4. - Leo Tavares, Feb 22 2023
From Elmo R. Oliveira, Oct 31 2024: (Start)
E.g.f.: (5 + 8*x + 4*x^2)*exp(x).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

More terms from Max Alekseyev, Mar 03 2010

A077426 Nonsquare integers n such that the continued fraction (sqrt(n)+1)/2 has odd period length.

Original entry on oeis.org

5, 13, 17, 29, 37, 41, 53, 61, 65, 73, 85, 89, 97, 101, 109, 113, 125, 137, 145, 149, 157, 173, 181, 185, 193, 197, 229, 233, 241, 257, 265, 269, 277, 281, 293, 313, 317, 325, 337, 349, 353, 365, 373, 389, 397, 401, 409, 421, 425, 433, 445, 449, 457, 461, 481, 485

Offset: 1

Wolfdieter Lang, Nov 29 2002

Nonsquare integers n for which Pell equation x^2 - n*y^2 = -4 has infinitely many integer solutions. The smallest solutions are given in A078356 and A078357.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, table p. 108).

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Wikipedia, Pell's equation

A subsequence of A077425.
Odd elements of A003814.
Cf. A077427, A172000.

isOddPrim := proc(n::integer)
    local cf;
    cf := numtheory[cfrac]((sqrt(n)+1)/2,'periodic','quotients') ;
    if nops(op(2,cf)) mod 2 =1 then
        RETURN(true) ;
    else
        RETURN(false) ;
    fi ;
end:
notA077426 := proc(n::integer)
    if issqr(n) then
        RETURN(true) ;
    elif not isOddPrim(n) then
        RETURN(true) ;
    else
        RETURN(false) ;
    fi ;
end:
A077426 := proc(n::integer)
    local resul,i ;
    resul := 5 ;
    i := 1 ;
    while i < n do
        resul := resul+4 ;
        while notA077426(resul) do
            resul := resul+4 ;
        od ;
        i:= i+1 ;
    od ;
    RETURN(resul) ;
end:
for n from 1 to 61 do print(A077426(n)) ; od : # R. J. Mathar, Apr 25 2006

fQ[n_] := !IntegerQ@ Sqrt@ n && OddQ@ Length@ ContinuedFraction[(Sqrt@ n + 1)/2][[2]]; Select[Range@ 500, fQ] (* Robert G. Wilson v, Nov 17 2012 *)

Edited and extended by Max Alekseyev, Mar 03 2010

Edited by Max Alekseyev, Mar 05 2010

A078356 Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.

Original entry on oeis.org

1, 3, 8, 5, 12, 64, 7, 39, 16, 2136, 9, 1000, 11208, 20, 261, 1552, 11, 3488, 24, 61, 213, 13, 1305, 136, 3528264, 28, 15, 46312, 142022136, 32, 12144, 164, 2613, 2127064, 17, 253724736, 89, 36, 2031654672, 18420, 142528, 19, 10236, 2564, 3447, 40, 223843593936

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

The corresponding values of t are given in A078357.
Computed from Perron's table (see reference p. 108) which gives the minimal x,y values for the Diophantine equation x^2 - x*y - ((D(m)-1)/4)*y^2 = +1 and -1 for respectively D(m)=A077425(m) and D(m)=A077426(m) (this second case excludes in Perron's table the D values with a 'Teilnenner' in brackets).
The conversion from the x,y values of Perron's table to the minimal a=a(n) and b=b(n) solutions of a^2 - D(n)*b^2 =-4 see a comment in A077428. Here only D values with no 'Teilnenner' in brackets are of interest and a(n)=2*x(n)-y(n) and b(n)=y(n). E.g. D=41, with 'Teilnenner von (sqrt(D)+1)/2' in the notation, explained in an example of A077427, 3,1,2 (period length k=5) and (x,y)=(37,10) which translates to the minimal solution (a,b)=(64,10).
Generic D(n) values are those from A078370(k)=(4*k(k+1)+5), k>=0, which are 5 (mod 8). For such D values the minimal solution is (a,b)=(2*k+1,1) (e.g. D(7)= A077426(7) = 53 = A078370(3) with a(7)= 2*3+1=7 and b(7)=A078357(7)=1).
The general solution of Pell a^2-D(n)*b^2 = -4 with generic D(n)=A078370(k), k>=0, is a(n,m)= (2*k+1)*S(2*m,sqrt(D(n))) and b(n,m)= T(2*m+1,sqrt(D(n))/2)/(sqrt(D(n))/2), m>=0, with T(n,x), resp. S(n,x), Chebyshev's polynomials of the first, resp. second, kind. See A053120 resp. A049310.
For non-generic D(n) (not from A078370) the general solution of a^2-D(n)*b^2 = -4 is a(n,m)=a(n)*S(2*m,sqrt(a(n)^2+4)) and b(n,m)= b(n)*T(2*m+1,sqrt(a(n)^2+4)/2)/(sqrt(a(n)^2+4)/2), m>=0, with Chebyshev's polynomials and in this case b(n)>1.

			41=D(6)=A077426(6) (also A077425(8)), hence a(6)=64 and b(6)=A078357(6)=10 satisfies 64^2 - 41*10^2 = -4.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Vincenzo Librandi, Table of n, a(n) for n = 1..200
Index entries for sequences related to Chebyshev polynomials.

$MaxExtraPrecision = 100; A077426 = Select[Range[ 500], ! IntegerQ[Sqrt[#]] && OddQ[ Length[ ContinuedFraction[(Sqrt[#] + 1)/2] // Last]] &]; a[n_] := {z, t} /. {ToRules[ Reduce[z > 0 && t > 0 && z^2 - A077426[[n]]*t^2 == -4, {z, t}, Integers] /. C[1] -> 0]} // Sort // First // First; Table[a[n], {n, 1, 50}] (* Jean-François Alcover, Jun 21 2013 *)

More terms from R. J. Mathar, Sep 24 2009

Edited by Max Alekseyev, Mar 03 2010

A077057 Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)b(n) - G(n)b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).

Original entry on oeis.org

1, 2, 5, 3, 3, 27, 7, 37, 4, 4, 171, 22, 9, 14, 1193, 5, 5, 553, 16, 6173, 11, 45, 143, 849, 6, 6, 18339, 94, 1893, 103, 13, 33, 2353, 115, 12703, 7, 7, 67115, 701, 73, 59, 1891117, 15, 551427, 23, 49771, 39, 4105015, 8, 8, 24673, 41, 75585293, 25, 9095891, 989, 17, 386, 6445, 87, 771, 1385

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

This equation can also be written as (2*a(n) - b(n))^2 - D(n)*b(n)^2 = +4 or -4 with D(n) := A077425(n) = 1 + 4*G(n).
This is from Perron's table (see reference p. 108, for n = 1..28) which gives the minimal x,y values which solve the above mentioned Diophantine equations.
For Pell equation x^2 - D*y^2 = +4, see A077428 and A078355. For Pell equation x^2 - D*y^2 = -4, see A078356 and A078357.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

Wolfdieter Lang, Pairs of smallest positive solutions for +1 and -1 if they exist.

Cf. A077427, A217470.

g[n_] := Ceiling[Sqrt[n]] + n - 1; r[n_] := Reduce[an > 0 && bn > 0 && (an ^2 - an*bn - g[n]*bn^2 == 1 || an^2 - an*bn - g[n]*bn^2 == - 1), {an, bn}, Integers] /. C -> c; ab[n_] := DeleteCases[ Flatten[ Table[{an, bn} /. {ToRules[r[n]]} // Simplify, {c[1], 0, 1}], 1], an | bn]; a[n_] := a[n] = Min[ab[n][[All, 1]]]; Table[Print[{n, a[n]}]; a[n], {n, 1, 62}] (* Jean-François Alcover, Oct 04 2012 *)

a(n) = (A078361(n) + A077058(n)) / 2. [Max Alekseyev, Feb 06 2010]

More terms from Max Alekseyev, Feb 06 2010

a(9), a(33), a(54) corrected (after notice by Jean-François Alcover); a(58) through a(62) added. - Wolfdieter Lang, Oct 04 2012

A077058 Minimal positive solution a(n) of Diophantine equation b(n)^2 - b(n)a(n) - G(n)a(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077057(n).

Original entry on oeis.org

1, 1, 2, 1, 1, 8, 2, 10, 1, 1, 40, 5, 2, 3, 250, 1, 1, 106, 3, 1138, 2, 8, 25, 146, 1, 1, 2968, 15, 298, 16, 2, 5, 352, 17, 1856, 1, 1, 9384, 97, 10, 8, 253970, 2, 72664, 3, 6440, 5, 521904, 1, 1, 3034, 5, 9148450, 3, 1084152, 117, 2, 45, 746, 10, 88, 157, 126890, 1, 1

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

This equation can also be written as (2*b(n)-a(n))^2 - D(n)*a(n)^2 = +4 or -4 with D(n) := A077425(n)=1+4*G(n).
This is from Perron's table (see reference p. 108, for n = 1..28) which gives the minimal x,y values which solve the above mentioned Diophantine equations.
For Pell equation x^2 - D*y^2 = +4, see A077428 and A078355. For Pell equation x^2 - D*y^2 = -4, see A078356 and A078357.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

g[n_] := Ceiling[ Sqrt[n] ] + n - 1; r[n_] := Reduce[an > 0 && (bn^2 - bn *an - g[n]*an^2 == 1 || bn^2 - bn *an - g[n]*an^2 == - 1), {an, bn}, Integers] /. C -> c; ab[n_] := DeleteCases[ Flatten[ Table[{an, bn} /. {ToRules[r[n]]} // Simplify, {c[1], 0, 1}] , 1] , an | bn]; a[n_] := a[n] = Min[ ab[n][[All, 1]] ]; Table[ Print[{n, a[n]}]; a[n], {n, 1, 65}] (* Jean-François Alcover, Oct 03 2012 *)

forstep(D=1,1000,4, if(issquare(D),next); u=bnfinit(x^2-D).fu[1]; k=1; while( denominator(t=polcoeff(lift(u^k),1)*2)>1, k++); print1(abs(t),", "); ) \\ Max Alekseyev, Feb 06 2010

More terms from Max Alekseyev, Feb 06 2010

A078361 Minimal positive solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 or -4 with D(n)=A077425(n). The companion sequence is b(n)=A077058(n).

Original entry on oeis.org

1, 3, 8, 5, 5, 46, 12, 64, 7, 7, 302, 39, 16, 25, 2136, 9, 9, 1000, 29, 11208, 20, 82, 261, 1552, 11, 11, 33710, 173, 3488, 190, 24, 61, 4354, 213, 23550, 13, 13, 124846, 1305, 136, 110, 3528264, 28, 1030190, 43, 93102, 73, 7688126, 15, 15, 46312, 77

Offset: 1

Wolfdieter Lang, Nov 29 2002

nonn

Computed from Perron's table (see reference p. 108, for n = 1..28) which gives the minimal x,y values for the Diophantine eq. x^2 - x*y - ((D(n)-1)/4)*y^2= +1, resp., -1 if D(n)=A077425(n), resp, D(n)=A077425(n) and D(n) also in A077426 (this second case excludes in Perron's table the D values with a 'Teilnenner' in brackets).
The conversion from the x,y values of Perron's table to the minimal a=a(n) and b=b(n) solutions is a(n)=2*x(n)-y(n) and b(n)=y(n). If D(n)=A077425(n) is not in A077426 then the equation with -4 has no solution and a(n) and b(n) are the minimal solutions of the a(n)^2 - D(n)*b(n)^2 = +4 equation. If D(n)=A077425(n) is in A077426 then the a(n) and b(n) values are the minimal solution of the a(n)^2 - D(n)*b(n)^2 = -4 equation. In this case a(+,n)= a(n)^2+2 and b(+,n)=a(n)*b(n) are the minimal solution of a^2 - D(n)*b^2 = +4.
For Pell equation a^2 - D*b^2 = +4, see A077428 and A078355. For Pell equation a^2 - D*b^2 = -4, see A078356 and A078357.

			29=D(5)=A077425(5) is A077426(4), hence a(5)=5 and b(5)=A077058(5)=1 solve a^2 - 29*b^2=-4 minimally and a(+,5)=a(5)^2+2=27 with b(+,5)=a(5)*b(5)=5*1=5 solve a^2 - 29*b^2=+4 minimally. See also A077428 with companion A078355.
21=D(4)=A077425(4) is not in A077426, hence a(4)=5 and b(4)=A077058(4)=1 give the solution with minimal positive b of a^2 - 21*b^2=+4.

O. Perron, "Die Lehre von den Kettenbruechen, Bd.I", Teubner, 1954, 1957 (Sec. 30, Satz 3.35, p. 109 and table p. 108).

More terms from Matthew Conroy, Apr 20 2003

A225432 Twice the coefficient of sqrt(q) in e^h, where e is the fundamental unit and h is the class number of Q(sqrt(q)), q prime and congruent to 1 mod 4. (The coefficient lies in (1/2)Z, so twice it is an integer.)

Original entry on oeis.org

1, 1, 2, 1, 2, 10, 1, 5, 250, 106, 1138, 2, 25, 146, 298, 5, 17, 1, 97, 253970, 2, 226, 3034, 9148450, 2050, 10, 157, 126890, 1, 14341370, 5, 110671282, 986, 7586, 530, 130, 173, 5129602, 11068353370, 21685, 694966754, 17883410, 5528222698, 17, 41, 11248618, 60037, 10, 242718010, 24514292738

Offset: 1

Robert R. Bruner, May 07 2013

nonn

This also arises in the relation satisfied by Euler classes in the connective K-theory of the classifying space of the group of order pq, where p=(q-1)/2. See p. 39 in Bruner and Greenlees, cited below. Take an irreducible representation of the cyclic group of order q which generates the representations as a ring, induce it up to the group of order pq, and let z be its Euler class in ku^{2p}(BG_{pq}). Then z satisfies the relation z^3 -2bq z^2 + qz = 0. This follows from the arithmetic fact that in Q(sort(q)) we have the relation e^h = a + b sqrt(q), as shown on pp. 39-42 of Bruner and Greenlees.
This is closely related to the subsequence of A078357 containing those entries such that the corresponding entry in A077426 is prime. However, a(22) = 226 (corresponding to e^3 = 1710 + 113*sqrt(229)) does not occur in A078357, and more such terms appear after this.
For the n-th Pythagorean prime q=A002144(n), a(n) is also -1/q of the coefficient of term x in the minimal polynomial of A=Product_{a} 2*sin(a*Pi/q) (where the index runs through all quadratic residues in {1,2,...,q-1}) and B=Product_{b} 2*sin(b*Pi/q) (where the index runs through all quadratic nonresidues in {1,2,...,q-1}). It is easy to show that A*B = p. By the class number formula of real quadratic number fields, one obtains B/A = e^(+-2h), so A+B = sqrt(q)*(e^h+e^(-h)) is exactly q*a(n). - Zichang Wang, Dec 15 2022

R. R. Bruner and J. P. C. Greenlees, The Connective K-theory of Finite Groups, Memoirs AMS, Vol. 165, No. 785, 2003.
T. Mitsuhiro, T. Nakahara and T. Uehara, The Class Number Formula of a Real Quadratic Field and an Estimate of the Value of a Unit, Canadian Mathematical Bulletin, 38(1)(1995), 98-103.

Zichang Wang, Table of n, a(n) for n = 1..2000
R. R. Bruner and J. P. C. Greenlees, The Connective K-theory of Finite Groups, Semantic Scholar.
T. Mitsuhiro, T. Nakahara and T. Uehara, The Class Number Formula of a Real Quadratic Field and an Estimate of the Value of a Unit.

Cf. A002144, A077426, A078357.

// Magma code to generate all terms for which the prime q is less than or equal to 4N+1 (an initial segment of the sequence). (Note that the brute force computation of the fundamental unit is very inefficient, and will have trouble producing the 39th term.)
N := 40;
pr := [4*n+1 : n in [1..N] | IsPrime(4*n+1)];
for i in [1..#pr] do
   q := pr[i];
   Q := QuadraticField(q);
   h := ClassNumber(Q);
   x := 1;
   while not IsSquare(x*x*q-4) do
      x := x+1;
   end while;
   x := x/2;
   tr,y := IsSquare(x*x*q-1);
   e := y + x*s;
   eh := e^h;
   b := (eh-Trace(eh)/2)/s;
   print i,2*b;
end for;

Mathematica

(* e.g., first 270 terms *) Lq = Select[4*Range[1000] + 1, PrimeQ[#] &]; Lh = NumberFieldClassNumber[Sqrt[Lq]]; Le = NumberFieldFundamentalUnits[Sqrt[Lq]]; Transpose[RootReduce[(Le^(2 Lh) + 1)/(Sqrt[Lq] Le^Lh)]][[1]] (* Zichang Wang, Dec 15 2022 *)

Extensions

a(39) onward from Zichang Wang, Dec 15 2022

cp's OEIS Frontend

A078370 a(n) = 4*(n+1)*n + 5.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Scala

Formula

Extensions

A077426 Nonsquare integers n such that the continued fraction (sqrt(n)+1)/2 has odd period length.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A078356 Minimal positive solution z of Pell equation z^2 - A077426(n)*t^2 = -4.

Views

Author

Keywords

Comments

Examples

References

Links

Programs

Mathematica

Extensions

A077057 Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)*b(n) - G(n)*b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A077058 Minimal positive solution a(n) of Diophantine equation b(n)^2 - b(n)*a(n) - G(n)*a(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077057(n).

Views

Author

Keywords

Comments

References

Programs

Mathematica

PARI

Extensions

A078361 Minimal positive solution a(n) of Pell equation a(n)^2 - D(n)*b(n)^2 = +4 or -4 with D(n)=A077425(n). The companion sequence is b(n)=A077058(n).

Views

Author

Keywords

Comments

Examples

References

Extensions

A225432 Twice the coefficient of sqrt(q) in e^h, where e is the fundamental unit and h is the class number of Q(sqrt(q)), q prime and congruent to 1 mod 4. (The coefficient lies in (1/2)Z, so twice it is an integer.)

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

A078370 a(n) = 4(n+1)n + 5.

A077057 Minimal positive solution a(n) of Diophantine equation a(n)^2 - a(n)b(n) - G(n)b(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077058(n).

A077058 Minimal positive solution a(n) of Diophantine equation b(n)^2 - b(n)a(n) - G(n)a(n)^2 = +1 or -1 with G(n) := A078358(n). The companion sequence is b(n)=A077057(n).