A051890 -id:A051890 - cp's OEIS frontend

A077075 Least k such that Z(k,4) <= Z(n,5) where Z(m,s) = Sum_{i>=m} 1/i^s.

2, 2, 3, 5, 7, 9, 12, 14, 17, 20, 23, 26, 30, 33, 36, 40, 44, 47, 51, 55, 59, 63, 67, 71, 75, 79, 84, 88, 92, 97, 101, 106, 111, 115, 120, 125, 129, 134, 139, 144, 149, 154, 159, 164, 169, 175, 180, 185, 190, 196, 201, 206, 212, 217, 223, 228, 234, 240, 245, 251

Offset: 0

Benoit Cloitre, Nov 29 2002

nonn

Cf. A051890 for least k such that Z(k,2) <= Z(n,3).

u=4; v=5; a(n)=if(n<0,0,k=1; while((zeta(u)-sum(k=1,k-1,1/k^u))>(zeta(v)-sum(i=1,n-1,1/i^v)),k++); k)

A077114 Least k such that Z(k,5) <= Z(n,6) where Z(m,s) = Sum_{i>=m} 1/i^s.

Original entry on oeis.org

2, 2, 3, 4, 6, 8, 10, 12, 14, 16, 19, 21, 23, 26, 28, 31, 34, 36, 39, 42, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 74, 77, 80, 83, 86, 89, 93, 96, 99, 102, 106, 109, 112, 116, 119, 123, 126, 129, 133, 136, 140, 143, 147, 150, 154, 158, 161, 165, 168, 172, 176, 179, 183

Offset: 0

Benoit Cloitre, Nov 29 2002

nonn

Cf. A051890 for least k such that Z(k,2) <= Z(n,3).

u=5; v=6; a(n)=if(n<0,0,k=1; while((zeta(u)-sum(k=1,k-1,1/k^u))>(zeta(v)-sum(i=1,n-1,1/i^v)),k++); k)

A077117 Least k such that Z(k,6) <= Z(n,7) where Z(m,s) = Sum_{i>=m} 1/i^s.

Original entry on oeis.org

2, 2, 3, 4, 6, 7, 9, 11, 13, 15, 16, 18, 20, 23, 25, 27, 29, 31, 33, 35, 38, 40, 42, 45, 47, 49, 52, 54, 56, 59, 61, 64, 66, 69, 71, 74, 76, 79, 81, 84, 86, 89, 92, 94, 97, 100, 102, 105, 108, 110, 113, 116, 119, 121, 124, 127, 130, 132, 135, 138, 141, 144, 146, 149

Offset: 0

Benoit Cloitre, Nov 29 2002

nonn

Cf. A051890 for least k such that Z(k,2) <= Z(n,3).

u=6; v=7; a(n)=if(n<0,0,k=1; while((zeta(u)-sum(k=1,k-1,1/k^u))>(zeta(v)-sum(i=1,n-1,1/i^v)),k++); k)

A173809 a(2n+1) = 1+A131941(2n+1). a(2n) = A131941(2n).

Original entry on oeis.org

2, 3, 9, 16, 30, 47, 73, 104, 146, 195, 257, 328, 414, 511, 625, 752, 898, 1059, 1241, 1440, 1662, 1903, 2169, 2456, 2770, 3107, 3473, 3864, 4286, 4735, 5217, 5728, 6274, 6851, 7465, 8112, 8798, 9519, 10281, 11080

Offset: 1

Paul Curtz, Feb 25 2010

An array T(n,k) of a(n) and its successive differences is T(1,k) = a(k), T(n,k) = T(n-1,k+1)-T(n-1,k) and starts:
2, 3, 9, 16, 30, 47, 73, 104, 146, 195, 257, 328,...
1, 6, 7, 14, 17, 26, 31, 42, 49, 62, 71, 86, 97, 114,... interleaved A056220 and A051890
5, 1, 7, 3, 9, 5, 11, 7, 13, 9, 15, 11, 17, 13, 19, 15.... A158552
-4, 6, -4, 6, -4, 6, -4, 6, -4, 6, -4, 6, -4, 6, -4,... A010711
10, -10, 10, -10, 10, -10, 10, -10, 10, -10, 10,..

Index entries for linear recurrences with constant coefficients, signature (3,-2,-2,3,-1).

LinearRecurrence[{3,-2,-2,3,-1},{2,3,9,16,30},60] (* Harvey P. Dale, Aug 10 2021 *)

G.f.: -x*(-2+3*x+x^3-4*x^2) / ( (1+x)*(x-1)^4 ). - R. J. Mathar, Jan 13 2011
a(2n) = A172482(n-1).
a(n)+a(n+1) = A116731(n+2). - R. J. Mathar, Jan 13 2011

A335444 Define the Fibonacci polynomials by F[1] = 1, F[2] = x; for n > 2, F[n] = xF[n-1] + F[n-2] (cf. A049310, A053119). Swamy's inequality states that F[n]^2 <= G[n] = (x^2 + 1)^2(x^2 + 2)^(n-3) for all n >= 3 and all real x. The sequence gives a triangle of the coefficients of the even exponents of G[n] - F[n]^2 read by rows.

Original entry on oeis.org

0, 2, 1, 3, 6, 2, 8, 19, 14, 3, 15, 52, 58, 26, 4, 32, 128, 192, 132, 42, 5, 63, 300, 558, 518, 253, 62, 6, 128, 679, 1496, 1742, 1152, 433, 86, 7, 255, 1506, 3801, 5294, 4413, 2248, 684, 114, 8, 512, 3292, 9308, 14999, 15040, 9680, 3992, 1018, 146, 9

Offset: 3

Petros Hadjicostas, Jun 10 2020

Swamy's (1966) inequality states that F[n]^2 <= G[n] for all real x and all integers n >= 3.
Row n >= 3 of this irregular table gives the coefficients of the even powers of the polynomial G[n] - F[n]^2 (with exponents in increasing order). The coefficients of the odd powers are zero, and they are thus omitted. The degree of G[n] - F[n]^2 is 2*n - 6, so row n >= 3 contains n - 2 terms.
To prove that the degree of G[n] - F[n]^2 is 2*n - 6, note that the first few terms of G[n] are x^(2*n-2) + 2*(n-2)*x^(2*n-4) + (2*n^2 - 10*n + 13)*x^(2*n-6) + ... while the first few terms of F[n]^2 are x^(2*n-2) + 2*(n-2)*x^(2*n-4) + (2*n^2 - 11*n + 16)*x^(2*n-6) + ..., so the leading term of the polynomial G[n] - F[n]^2 is (n-3)*x^(2*n-6).
Guilfoyle (1967) notes that F[n] = det(A_n), where A_n is the (n-1) X (n-1) matrix [[x, -1, 0, 0, ..., 0, 0, 0], [1, x, -1, 0, ..., 0, 0, 0], [0, 1, x, -1, ..., 0, 0, 0], ..., [0, 0, 0, 0, ..., 1, x, -1], [0, 0, 0, 0, ..., 0, 1, x]], and Swamy's original inequality follows from Hadamard's inequality.
Koshy (2019) writes Swamy's original inequality in the form x^(n-3)*F[n]^2 <= F[3]^2*F[4]^(n-3) for x >= 1, and gives a counterpart inequality for Lucas polynomials. Notice, however, that the original form of Swamy's inequality is true for all real x.

			Triangle T(n,k) (with rows n >= 3 and columns k = 0..n-3) begins:
   0;
   2,   1;
   3,   6,   2;
   8,  19,  14,   3;
  15,  52,  58,  26,  4;
  32, 128, 192, 132, 42, 5;
  ...

Thomas Koshy, Fibonacci and Lucas numbers with Applications, Vol. 2, Wiley, 2019; see p. 33. [Vol. 1 was published in 2001.]
D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; see p. 232, Sect. 3.3.38.

Richard Guilfoyle, Comment to the solution of Problem E1846, Amer. Math. Monthly, 74(5), 1967, 593. [It is pointed out that the inequality is a special case of Hadamard's inequality.]
M. N. S. Swamy, Problem E1846 proposed for solution, Amer. Math. Monthly, 73(1) (1966), 81.
M. N. S. Swamy and R. E. Giudici, Solution to Problem E1846, Amer. Math. Monthly, 74(5), 1967, 592-593.
M. N. S. Swamy and Joel Pitcain, Comment to Problem E1846, Amer. Math. Monthly, 75(3) (1968), 295. [It is pointed out that I^{n-1}*F[n](x) = U_{n-1}(I*x/2), where U_{n-1}(cos(t)) = sin(n*t)/sin(t) and I = sqrt(-1); Cf. A049310 and A053119, but with different notation.]
Wikipedia, Fibonacci polynomials.
Wikipedia, Hadamard's inequality.

Cf. A002620, A045623, A049310, A051890, A053119, A128932 (similar), A166920.

lista(nn) = {my(f=vector(nn)); my(g=vector(nn)); my(h=vector(nn)); f[1]=1; f[2]=x; g[1]=0; g[2]=0; for(n=3, nn, g[n] = (x^2+1)^2*(x^2+2)^(n-3)); for(n=3, nn, f[n] = x*f[n-1]+f[n-2]); for(n=1, nn, h[n] = g[n]-f[n]^2); for(n=3, nn, for(k=0, n-3, print1(polcoef(h[n], 2*k, x), ", ")); print(); ); }

T(n,0) = 2^(n-3) - (1 - (-1)^n)/2 = A166920(n-3) for n >= 3.
T(n,1) = 2^(n-4)*(n + 1) - floor(n/2)*ceiling(n/2) = A045623(n-2) - A002620(n) for n >= 4.
T(n, n-4) = 2*(n^2 - 7*n + 13) = A051890(n-3) for n >= 4.
T(n, n-3) = n - 3 for n >= 3.

cp's OEIS Frontend

A077075 Least k such that Z(k,4) <= Z(n,5) where Z(m,s) = Sum_{i>=m} 1/i^s.

Views

Author

Keywords

Crossrefs

Programs

PARI

A077114 Least k such that Z(k,5) <= Z(n,6) where Z(m,s) = Sum_{i>=m} 1/i^s.

Views

Author

Keywords

Crossrefs

Programs

PARI

A077117 Least k such that Z(k,6) <= Z(n,7) where Z(m,s) = Sum_{i>=m} 1/i^s.

Views

Author

Keywords

Crossrefs

Programs

PARI

A173809 a(2n+1) = 1+A131941(2n+1). a(2n) = A131941(2n).

Views

Author

Keywords

Comments

Links

Programs

Mathematica

Formula

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Formula