A159678 -id:A159678 - cp's OEIS frontend

A157456 Expansion of x * (1 - x) / (1 - 16*x + x^2).

1, 15, 239, 3809, 60705, 967471, 15418831, 245733825, 3916322369, 62415424079, 994730462895, 15853271982241, 252657621252961, 4026668668065135, 64174041067789199, 1022757988416562049, 16299953773597203585, 259776502389138695311, 4140124084452621921391

Offset: 1

Paul Weisenhorn, Mar 01 2009

Positive values of x (or y) satisfying x^2 - 16xy + y^2 + 14 = 0. - Colin Barker, Feb 11 2014

Vincenzo Librandi, Table of n, a(n) for n = 1..200
J.-C. Novelli, J.-Y. Thibon, Hopf Algebras of m-permutations,(m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962 [math.CO], 2014.
Index entries for linear recurrences with constant coefficients, signature (16,-1).

Cf. A159678.

Cf. similar sequences listed in A238379.

I:=[1,15]; [n le 2 select I[n] else 16*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Feb 12 2014

f:= gfun:-rectoproc({a(n)=16*a(n-1)-a(n-2),a(1)=1,a(2)=15},a(n),remember):
map(f, [$1..30]); # Robert Israel, Jul 07 2015

CoefficientList[Series[(1 - x)/(1 - 16 x + x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Feb 12 2014 *)
LinearRecurrence[{16,-1},{1,15},20] (* Harvey P. Dale, Sep 17 2019 *)

G.f.: x*(1-x) / ( 1-16*x+x^2 ). - R. J. Mathar, Oct 31 2011
a(n) = 16*a(n-1)-a(n-2). - Colin Barker, Feb 11 2014
a(n) = (1/18)*(9-sqrt(63))*(1+(8+sqrt(63))^(2*n-1))/(8+sqrt(63))^(n-1). [Bruno Berselli, Feb 25 2014]
a(n) = sqrt(2+(8-3*sqrt(7))^(1+2*n)+(8+3*sqrt(7))^(1+2*n))/(3*sqrt(2)). - Gerry Martens, Jun 06 2015
a(n) = A077412(n-1) - A077412(n-2). - R. J. Mathar, Feb 05 2020

New name (using the g.f. by R. J. Mathar) from Joerg Arndt, Jun 06 2015

A160682 The list of the A values in the common solutions to 13k+1 = A^2 and 17k+1 = B^2.

Original entry on oeis.org

1, 14, 209, 3121, 46606, 695969, 10392929, 155197966, 2317576561, 34608450449, 516809180174, 7717529252161, 115246129602241, 1720974414781454, 25699370092119569, 383769576967012081, 5730844284413061646, 85578894689228912609, 1277952576054020627489

Offset: 1

Paul Weisenhorn, May 23 2009

This summarizes the case C=13 of common solutions to C*k+1=A^2, (C+4)*k+1=B^2.
The 2 equations are equivalent to the Pell equation x^2-C*(C+4)*y^2=1,
with x=(C*(C+4)*k+C+2)/2; y=A*B/2 and with smallest values x(1) = (C+2)/2, y(1)=1/2.
Generic recurrences are:
A(j+2)=(C+2)*A(j+1)-A(j) with A(1)=1; A(2)=C+1.
B(j+2)=(C+2)*B(j+1)-B(j) with B(1)=1; B(2)=C+3.
k(j+3)=(C+1)*(C+3)*( k(j+2)-k(j+1) )+k(j) with k(1)=0; k(2)=C+2; k(3)=(C+1)*(C+2)*(C+3).
x(j+2)=(C^2+4*C+2)*x(j+1)-x(j) with x(1)=(C+2)/2; x(2)=(C^2+4*C+1)*(C+2)/2;
Binet-type of solutions of these 2nd order recurrences are:
R=C^2+4*C; S=C*sqrt(R); T=(C+2); U=sqrt(R); V=(C+4)*sqrt(R);
A(j)=((R+S)*(T+U)^(j-1)+(R-S)*(T-U)^(j-1))/(R*2^j);
B(j)=((R+V)*(T+U)^(j-1)+(R-V)*(T-U)^(j-1))/(R*2^j);
x(j)+sqrt(R)*y(j)=((T+U)*(C^2*4*C+2+(C+2)*sqrt(R))^(j-1))/2^j;
k(j)=(((T+U)*(R+2+T*U)^(j-1)+(T-U)*(R+2-T*U)^(j-1))/2^j-T)/R. [Paul Weisenhorn, May 24 2009]
.C -A----- -B----- -k-----
01 A001519 A002878 A058038
02 A001653 A002315 A045899/2
03 A004253 A030221 A160695
04 A001653 A002315 A078522/4
05 A049685 A033890 A161582
06 A070997 A057080 A159683/2
07 A070998 A057081 A161585
08 A072256 A054320 A045502/4
09 A078922 A097783 A161586
10 A077417 A077416 A159681/2
11 A085260 A126816 A161588
12 A001570 A028230 A059989/4
13 A160682 A161591 A161584
14 A157456 A159678 A159679/2
15 A161595 A161599 A161583
16 A007805 A049629 A157459/4
For n>=2, a(n) equals the permanent of the (2n-2)X(2n-2) tridiagonal matrix with sqrt(13)'s along the main diagonal, and 1's along the superdiagonal and the subdiagonal. [John M. Campbell, Jul 08 2011]
Positive values of x (or y) satisfying x^2 - 15xy + y^2 + 13 = 0. - Colin Barker, Feb 11 2014

Vincenzo Librandi, Table of n, a(n) for n = 1..200
J.-C. Novelli, J.-Y. Thibon, Hopf Algebras of m-permutations,(m+1)-ary trees, and m-parking functions, arXiv preprint arXiv:1403.5962 [math.CO], 2014.
Index entries for the Pell equation
Index entries for linear recurrences with constant coefficients, signature (15,-1).

Cf. similar sequences listed in A238379.

I:=[1,14]; [n le 2 select I[n] else 15*Self(n-1)-Self(n-2): n in [1..30]]; // Vincenzo Librandi, Feb 12 2014

LinearRecurrence[{15,-1},{1,14},20] (* Harvey P. Dale, Oct 08 2012 *)
CoefficientList[Series[(1 - x)/(1 - 15 x + x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Feb 12 2014 *)

a(n) = round((2^(-1-n)*((15-sqrt(221))^n*(13+sqrt(221))+(-13+sqrt(221))*(15+sqrt(221))^n))/sqrt(221)) \\ Colin Barker, Jul 25 2016

a(n) = 15*a(n-1)-a(n-2).
G.f.: (1-x)*x/(1-15*x+x^2).
a(n) = (2^(-1-n)*((15-sqrt(221))^n*(13+sqrt(221))+(-13+sqrt(221))*(15+sqrt(221))^n))/sqrt(221). - Colin Barker, Jul 25 2016

Edited, extended by R. J. Mathar, Sep 02 2009

First formula corrected by Harvey P. Dale, Oct 08 2012

A244419 Coefficient triangle of polynomials related to the Dirichlet kernel. Rising powers. Riordan triangle ((1+z)/(1+z^2), 2*z/(1+z^2)).

Original entry on oeis.org

1, 1, 2, -1, 2, 4, -1, -4, 4, 8, 1, -4, -12, 8, 16, 1, 6, -12, -32, 16, 32, -1, 6, 24, -32, -80, 32, 64, -1, -8, 24, 80, -80, -192, 64, 128, 1, -8, -40, 80, 240, -192, -448, 128, 256, 1, 10, -40, -160, 240, 672, -448, -1024, 256, 512, -1, 10, 60, -160, -560, 672, 1792, -1024, -2304, 512, 1024

Offset: 0

Wolfdieter Lang, Jul 29 2014

This is the row reversed version of A180870. See also A157751 and A228565.
The Dirichlet kernel is D(n,x) = Sum_{k=-n..n} exp(i*k*x) = 1 + 2*Sum_{k=1..n} T(n,x) = S(n, 2*y) + S(n-1, 2*y) = S(2*n, sqrt(2*(1+y))) with y = cos(x), n >= 0, with the Chebyshev polynomials T (A053120) and S (A049310). This triangle T(n, k) gives in row n the coefficients of the polynomial Dir(n,y) = D(n,x=arccos(y)) = Sum_{m=0..n} T(n,m)*y^m. See A180870, especially the Peter Bala comments and formulas.
This is the Riordan triangle ((1+z)/(1+z^2), 2*z/(1+z^2)) due to the o.g.f. for Dir(n,y) given by (1+z)/(1 - 2*y*z + z^2) = G(z)/(1 - y*F(z)) with G(z) = (1+z)/(1+z^2) and F(z) = 2*z/(1+z^2) (see the Peter Bala formula under A180870). For Riordan triangles and references see the W. Lang link 'Sheffer a- and z- sequences' under A006232.
The A- and Z- sequences of this Riordan triangle are (see the mentioned W. Lang link in the preceding comment also for the references): The A-sequence has o.g.f. 1+sqrt(1-x^2) and is given by A(2*k+1) = 0 and A(2*k) [2, -1/2, -1/8, -1/16, -5/128, -7/256, -21/1024, -33/2048, -429/32768, -715/65536, ...], k >= 0. (See A098597 and A046161.)
  The Z-sequence has o.g.f. sqrt((1-x)/(1+x)) and is given by
  [1, -1, 1/2, -1/2, 3/8, -3/8, 5/16, -5/16, 35/128, -35/128, ...]. (See A001790 and A046161.)
The column sequences are A057077, 2*(A004526 with even numbers signed), 4*A008805 (signed), 8*A058187 (signed), 16*A189976 (signed), 32*A189980 (signed) for m = 0, 1, ..., 5.
The row sums give A005408 (from the o.g.f. due to the Riordan property), and the alternating row sums give A033999.
The row polynomials Dir(n, x), n >= 0, give solutions to the diophantine equation (a + 1)*X^2 - (a - 1)*Y^2 = 2 by virtue of the identity (a + 1)*Dir(n, -a)^2 - (a - 1)*Dir(n, a)^2 = 2, which is easily proved inductively using the recurrence Dir(n, a) = (1 + a)*(-1)^(n-1)*Dir(n-1, -a) + a*Dir(n-1, a) given below by Wolfdieter Lang. - Peter Bala, May 08 2025

			The triangle T(n,m) begins:
  n\m  0   1   2    3    4    5    6     7     8    9    10 ...
  0:   1
  1:   1   2
  2:  -1   2   4
  3:  -1  -4   4    8
  4:   1  -4 -12    8   16
  5:   1   6 -12  -32   16   32
  6:  -1   6  24  -32  -80   32   64
  7:  -1  -8  24   80  -80 -192   64   128
  8:   1  -8 -40   80  240 -192 -448   128   256
  9:   1  10 -40 -160  240  672 -448 -1024   256  512
  10: -1  10  60 -160 -560  672 1792 -1024 -2304  512  1024
  ...
Example for A-sequence recurrence: T(3,1) = Sum_{j=0..2} A(j)*T(2,j) = 2*(-1) + 0*2 + (-1/2)*4 = -4. Example for Z-sequence recurrence: T(4,0) = Sum_{j=0..3} Z(j)*T(3,j) = 1*(-1) + (-1)*(-4) + (1/2)*4 + (-1/2)*8 = +1. (For the A- and Z-sequences see a comment above.)
Example for the alternate recurrence: T(4,2) = 2*T(3,1) - T(3,2) = 2*(-4) - 4 = -12. T(4,3) = 0*T(3,2) + T(3,3) = T(3,3) = 8. - _Wolfdieter Lang_, Jul 30 2014

Wikipedia, Dirichlet kernel.

Dir(n, x) : A005408 (x = 1), A002878 (x = 3/2), A001834 (x = 2), A030221 (x = 5/2), A002315 (x = 3), A033890 (x = 7/2), A057080 (x = 4), A057081 (x = 9/2), A054320 (x = 5), A077416 (x = 6), A028230 (x = 7), A159678 (x = 8), A049629 (x = 9), A083043 (x = 10),
(-1)^n * Dir(n, x): A122367 (x = -3/2); A079935 (x = -2), A004253 (x = -5/2), A001653 (x = -3), A049685 (x = -7/2), A070997 (x = -4), A070998 (x = -9/2), A072256(n+1) (x = -5).
Cf. A180870 (row reversed), A157751, A228565, A049310, A053120, A057077, A004526, A008805, A058187, A189976, A189980, A005408, A033999.

T[n_, k_] := T[n, k] = Which[k == 0, (-1)^Quotient[n, 2], (0 <= n && n < k) || (n == -1 && k == 1), 0, True, 2 T[n-1, k-1] - T[n-2, k]];
Table[T[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jun 28 2019, from Sage *)

def T(n, k):
    if k == 0: return (-1)^(n//2)
    if (0 <= n and n < k) or (n == -1 and k == 1): return 0
    return 2*T(n-1, k-1) - T(n-2, k)
for n in range(11): [T(n,k) for k in (0..n)] # Peter Luschny, Jul 29 2014

T(n, m) = [y^m] Dir(n,y) for n >= m >= 0 and 0 otherwise, with the polynomials Dir(y) defined in a comment above.
T(n, m) = 2^m*(S(n,m) + S(n-1,m)) with the entries S(n,m) of A049310 given there explicitly.
O.g.f. for polynomials Dir(y) see a comment above (Riordan triangle ((1+z)/(1+z^2), 2*z/(1+z^2))).
O.g.f. for column m: ((1 + x)/(1 + x^2))*(2*x/(1 + x^2))^m, m >= 0, (Riordan property).
Recurrence for the polynomials: Dir(n, y) = 2*y*Dir(n-1, y) - Dir(n-2, y), n >= 1, with input D(-1, y) = -1 and D(0, y) = 1.
Triangle three-term recurrence: T(n,m) = 2*T(n-1,m-1) - T(n-2,m) for n >= m >= 1 with T(n,m) = 0 if 0 <= n < m, T(0,0) = 1, T(-1,1) = 0 and T(n,0) = A057077(n) = (-1)^(floor(n/2)).
From Wolfdieter Lang, Jul 30 2014: (Start)
In analogy to A157751 one can derive a recurrence for the row polynomials Dir(n, y) = Sum_{m=0..n} T(n,m)*y^m also using a negative argument but only one recursive step: Dir(n,y) = (1+y)*(-1)^(n-1)*Dir(n-1,-y) + y*Dir(n-1,y), n >= 1, Dir(0,y) = 1 (Dir(-1,y) = -1). See also A180870 from where this formula can be derived by row reversion.
This entails another triangle recurrence T(n,m) = (1 + (-1)^(n-m))*T(n-1,m-1) - (-1)^(n-m)*T(n-1,m), for n >= m >= 1 with T(n,m) = 0 if n < m and T(n,0) = (-1)^floor(n/2). (End)
From Peter Bala, Aug 14 2022: (Start)
The row polynomials Dir(n,x), n >= 0, are related to the Chebyshev polynomials of the first kind T(n,x) by the binomial transform as follows:
(2^n)*(x - 1)^(n+1)*Dir(n,x) = (-1) * Sum_{k = 0..2*n+1} binomial(2*n+1,k)*T(k,-x).
Note that Sum_{k = 0..2*n} binomial(2*n,k)*T(k,x) = (2^n)*(1 + x)^n*T(n,x). (End)
From Peter Bala, May 04 2025: (Start)
For n >= 1, the n-th row polynomial Dir(n, x) = (-1)^n * (U(n, -x) - U(n-1, -x)) = U(2*n, sqrt((1+x)/2)), where U(n, x) denotes the n-th Chebyshev polynomial of the second kind.
For n >= 1 and x < 1, Dir(n, x) = (-1)^n * sqrt(2/(1 - x )) * T(2*n+1, sqrt((1 - x)/2)), where T(n, x) denotes the n-th Chebyshev polynomial of the first kind.
Dir(n, x)^2 - 2*x*Dir(n, x)*Dir(n+1, x) + Dir(n+1, x)^2 = 2*(1 + x).
Dir(n, x) = (-1)^n * R(n, -2*(x+1)), where R(n, x) is the n-th row polynomial of the triangle A085478.
Dir(n, x) = Sum_{k = 0..n} (-1)^(n+k) * binomial(n+k, 2*k) * (2*x + 2)^k. (End)

A257711 Triangular numbers (A000217) that are the sum of seven consecutive triangular numbers.

Original entry on oeis.org

210, 3486, 51681, 883785, 13125126, 224476266, 3333728685, 57016086141, 846753959226, 14481861401910, 215072171913081, 3678335779997361, 54627484911961710, 934282806257926146, 13875166095466359621, 237304154453733242085, 3524237560763543380386

Offset: 1

Colin Barker, May 05 2015

			210 is in the sequence because T(20) = 210 = 10+15+21+28+36+45+55 = T(4)+ ... +T(10).

Colin Barker, Table of n, a(n) for n = 1..830
Index entries for linear recurrences with constant coefficients, signature (1,254,-254,-1,1).

Cf. A000217, A001110, A129803, A131557, A257712, A257713, A259413, A259414, A259415.

LinearRecurrence[{1, 254, -254, -1, 1}, {210, 3486, 51681, 883785, 13125126}, 30] (* Vincenzo Librandi, Jun 27 2015 *)

Vec(-21*x*(x^4-245*x^2+156*x+10) / ((x-1)*(x^2-16*x+1)*(x^2+16*x+1)) + O(x^100))

G.f.: -21*x*(x^4-245*x^2+156*x+10) / ((x-1)*(x^2-16*x+1)*(x^2+16*x+1)).

16*a(n) = 104 +225*A157456(n+1) +7*(-1)^n*A159678(n+1). - R. J. Mathar, Apr 28 2020

A084069 Numbers k such that 7k^2 = floor(ksqrt(7)ceiling(ksqrt(7))).

Original entry on oeis.org

1, 3, 17, 48, 271, 765, 4319, 12192, 68833, 194307, 1097009, 3096720, 17483311, 49353213, 278635967, 786554688, 4440692161, 12535521795, 70772438609, 199781794032, 1127918325583, 3183973182717, 17975920770719, 50743789129440

Offset: 1

Benoit Cloitre, May 10 2003

nonn

This is a strong divisibility sequence, that is, GCD(a(n),a(m)) = a(GCD(n,m)) for all positive integers n and m. Consequently, this is a divisibility sequence: if n divides m then a(n) divides a(m). - Peter Bala, Sep 01 2019

Wikipedia, Lehmer sequence
Index entries for linear recurrences with constant coefficients, signature (0,16,0,-1).

Cf. A159678, A001080, A001653, A001353, A060645, A001078, A001109, A084068, A084070, A143643.

CoefficientList[Series[(1+3x+x^2)/(1-16x^2+x^4),{x,0,30}],x] (* or *) LinearRecurrence[{0,16,0,-1},{1,3,17,48},31] (* Harvey P. Dale, Oct 31 2011 *)

a(1)=1, a(2)=3, a(2n) = 6*a(2n-1)-a(2n-2); a(2n+1) = 3*a(2n)-a(2n-1).
a(n)*a(n+3) = -3 + a(n+1)*a(n+2).
G.f.: x*(1+3*x+x^2)/(1-16*x^2+x^4). [corrected by Harvey P. Dale, Oct 31 2011]
a(n) = 16*a(n-2) - a(n-4), n > 4. - Harvey P. Dale, Oct 31 2011
a(n) = U_n(sqrt(18),1) = (alpha^n - beta^n)/(alpha - beta) for n odd and a(n) = 3*U_n(sqrt(18),1) = (sqrt(2)/2)*(alpha^n - beta^n)/(alpha - beta) for n even, where U_n(sqrt(R),Q) denotes the Lehmer sequence with parameters R and Q and alpha = (sqrt(3) + sqrt(14))/2 and beta = (sqrt(3) - sqrt(14))/2. - Peter Bala, Sep 01 2019

A159679 a(n) are solutions of the 2 equations: 7a(n) +1 = c(n)^2 and 9a(n) +1 = b(n)^2.

Original entry on oeis.org

0, 32, 8160, 2072640, 526442432, 133714305120, 33962907058080, 8626444678447232, 2191082985418538880, 556526451851630428320, 141355527687328710254432, 35903747506129640774197440, 9119410511029241427935895360, 2316294366053921193054943224032

Offset: 1

Paul Weisenhorn, Apr 19 2009

Colin Barker, Table of n, a(n) for n = 1..400
Index entries for linear recurrences with constant coefficients, signature (255,-255,1).

Cf. A077412, A157456, A159678.

R:=PowerSeriesRing(Integers(), 50); [0] cat Coefficients(R!(32*x^2/((1-x)*(1-254*x+x^2)))); // G. C. Greubel, Jun 03 2018

for a from 1 by 2 to 100000 do b:=sqrt((9*a*a-2)/7): if (trunc(b)=b) then
n:=(a*a-1)/7: La:=[op(La),a]:Lb:=[op(Lb),b]:Ln:=[op(Ln),n]: end if: end do:
# Second program
seq((8/63)*(simplify(ChebyshevU(n,127) -253*ChebyshevU(n-1,127)) -1), n=1..30); # G. C. Greubel, Sep 27 2022

LinearRecurrence[{255,-255,1}, {0, 32, 8160}, 50] (* or *) CoefficientList[Series[32*x^2/((1-x)*(x^2-254*x+1)), {x,0,50}], x] (* G. C. Greubel, Jun 03 2018 *)

concat(0, Vec(32*x^2/(-x^3+255*x^2-255*x+1) + O(x^100))) \\ Colin Barker, Mar 18 2014

a(n) = round((-16+(8+3*sqrt(7))*(127+48*sqrt(7))^(-n)+(8-3*sqrt(7))*(127+48*sqrt(7))^n)/126) \\ Colin Barker, Jul 25 2016

[(8/63)*(-1 + chebyshev_U(n, 127) - 253*chebyshev_U(n-1, 127)) for n in range(1,30)] # G. C. Greubel, Sep 27 2022

G.f.: 32*x^2 / ((1-x)*(1-254*x+x^2)).
c(n) = A157456(n).
b(n) = A159678(n).
a(n+3) = 255*(a(n+2) -a(n+1)) + a(n).
a(n) = 2*A077412(n-2)*A077412(n-1). - Johannes Boot, Jan 17 2011
a(n) = (-16+(8+3*sqrt(7))*(127+48*sqrt(7))^(-n)+(8-3*sqrt(7))*(127+48*sqrt(7))^n)/126. - Colin Barker, Jul 25 2016
a(n) = (8/63)*(-1 + ChebyshevU(n, 127) - 253*ChebyshevU(n-1, 127)). - G. C. Greubel, Sep 27 2022

More terms from Colin Barker, Mar 18 2014

A266698 x-values of solutions to the Diophantine equation x^2 - 7*y^2 = 2.

Original entry on oeis.org

3, 45, 717, 11427, 182115, 2902413, 46256493, 737201475, 11748967107, 187246272237, 2984191388685, 47559815946723, 757972863758883, 12080006004195405, 192522123203367597, 3068273965249686147, 48899861320791610755, 779329507167416085933, 12420372253357865764173, 197946626546558436140835

Offset: 1

Sture Sjöstedt, Jan 03 2016

A159678 gives the y-values of solutions to the Diophantine equation x^2 - 7*y^2 = 2.

G. C. Greubel, Table of n, a(n) for n = 1..750
Index entries for linear recurrences with constant coefficients, signature (16,-1).

Cf. A041008, A077412, A157456, A159678.

[n: n in [1..2*10^7] | IsSquare((n^2-2)/7)]; // Vincenzo Librandi, Jan 06 2016

Mathematica
```
LinearRecurrence[{16,-1}, {3, 45}, 20 ]
```

lista(nn) = {print1(x = 3, ", "); print1(y = 45, ", "); for (n=2, nn, z = 16*y - x; print1(z, ", "); x = y; y = z;);} \\ Michel Marcus, Jan 05 2016

[3*(chebyshev_U(n-1, 8) - chebyshev_U(n-2, 8)) for n in (1..30)] # G. C. Greubel, Jun 25 2022

a(1)=3, a(2)=45, a(n) = 16*a(n-1) - a(n-2).
a(n) = A041008(4n-2). - Robert Israel, Jan 05 2016
From R. J. Mathar, Jan 12 2016: (Start)
G.f.: 3*x*(1-x) / ( 1-16*x+x^2 ).
a(n) = 3*A157456(n). (End)
From G. C. Greubel, Jun 25 2022: (Start)
a(n) = 3*(ChebyshevU(n-1, 8) - ChebyshevU(n-2, 8)).
E.g.f.: exp(8*x)*(3*cosh(3*sqrt(7)*x) - sqrt(7)*sinh(3*sqrt(7)*x)) - 3. (End)

cp's OEIS Frontend

A157456 Expansion of x * (1 - x) / (1 - 16*x + x^2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Formula

Extensions

A160682 The list of the A values in the common solutions to 13*k+1 = A^2 and 17*k+1 = B^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A244419 Coefficient triangle of polynomials related to the Dirichlet kernel. Rising powers. Riordan triangle ((1+z)/(1+z^2), 2*z/(1+z^2)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Sage

Formula

A257711 Triangular numbers (A000217) that are the sum of seven consecutive triangular numbers.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A084069 Numbers k such that 7*k^2 = floor(k*sqrt(7)*ceiling(k*sqrt(7))).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A159679 a(n) are solutions of the 2 equations: 7*a(n) +1 = c(n)^2 and 9*a(n) +1 = b(n)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

SageMath

Formula

Extensions

A266698 x-values of solutions to the Diophantine equation x^2 - 7*y^2 = 2.

Views

Author

Keywords

Comments

A160682 The list of the A values in the common solutions to 13k+1 = A^2 and 17k+1 = B^2.

A084069 Numbers k such that 7k^2 = floor(ksqrt(7)ceiling(ksqrt(7))).

A159679 a(n) are solutions of the 2 equations: 7a(n) +1 = c(n)^2 and 9a(n) +1 = b(n)^2.