cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A138288 a(n) = A054320(n) - A001078(n).

Original entry on oeis.org

1, 9, 89, 881, 8721, 86329, 854569, 8459361, 83739041, 828931049, 8205571449, 81226783441, 804062262961, 7959395846169, 78789896198729, 779939566141121, 7720605765212481, 76426118085983689, 756540575094624409, 7488979632860260401, 74133255753507979601, 733843577902219535609
Offset: 0

Views

Author

Reinhard Zumkeller, Mar 12 2008

Keywords

Comments

Numbers k such that 6*k^2 - 2 is a square. - Bruno Berselli, Feb 10 2014

Examples

			1 + 9*x + 89*x^2 + 881*x^3 + 8721*x^4 + 86329*x^5 + ...
		

References

  • H. Brocard, Note #2049, L'Intermédiaire des Mathématiciens, 8 (1901), pp. 212-213. - N. J. A. Sloane, Mar 02 2022

Crossrefs

Cf. similar sequences listed in A238379.

Programs

  • Mathematica
    CoefficientList[Series[(1 - x)/(1 - 10 x + x^2), {x, 0, 40}], x] (* Vincenzo Librandi, Feb 12 2014 *)
    a[c_, n_] := Module[{},
      p := Length[ContinuedFraction[ Sqrt[ c]][[2]]];
      d := Denominator[Convergents[Sqrt[c], n p]];
      t := Table[d[[1 + i]], {i, 0, Length[d] - 1, p}];
      Return[t];
      ] (* Complement of A041007, A041039 *)
    a[6, 20] (* Gerry Martens, Jun 07 2015 *)
  • PARI
    {a(n) = subst( poltchebi(n+1) + poltchebi(n), x, 5) / 6} /* Michael Somos, Jan 25 2013 */
  • Sage
    [lucas_number1(n,10,1)-lucas_number1(n-1,10,1) for n in range(1, 20)] # Zerinvary Lajos, Nov 10 2009
    

Formula

a(n) = A072256(n+1).
a(n) = A001079(n) + 2*A001078(n).
a(n) = 10*a(n-1) - a(n-2). a(-1) = a(0) = 1.
(sqrt(2)+sqrt(3))^(2*n+1) = A054320(n-1)*sqrt(2) + a(n)*sqrt(3).
From Michael Somos, Jan 25 2013: (Start)
G.f.: (1 - x) / (1 - 10*x + x^2).
a(-1-n) = a(n). (End)
a(n) = sqrt(2+(5-2*sqrt(6))^(1+2*n)+(5+2*sqrt(6))^(1+2*n))/(2*sqrt(3)). - Gerry Martens, Jun 04 2015
E.g.f.: exp(5*x)*(3*cosh(2*sqrt(6)*x) + sqrt(6)*sinh(2*sqrt(6)*x))/3. - Stefano Spezia, May 16 2023

A041038 Numerators of continued fraction convergents to sqrt(24).

Original entry on oeis.org

4, 5, 44, 49, 436, 485, 4316, 4801, 42724, 47525, 422924, 470449, 4186516, 4656965, 41442236, 46099201, 410235844, 456335045, 4060916204, 4517251249, 40198926196, 44716177445, 397928345756
Offset: 0

Views

Author

Keywords

Crossrefs

Programs

Formula

a(2n) = 2*A041006(2n) ; a(2n-1) = A041006(2n-1) = A001079(n). [From M. F. Hasler, Feb 13 2009]
G.f.: (4+5*x+4*x^2-x^3)/(1-10*x^2+x^4)

A192062 Square Array T(ij) read by antidiagonals (from NE to SW) with columns 2j being the denominators of continued fraction convergents to square root of (j^2 + 2j).

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 2, 0, 1, 1, 3, 3, 1, 0, 1, 1, 4, 4, 5, 3, 0, 1, 1, 5, 5, 11, 8, 1, 0, 1, 1, 6, 6, 19, 15, 13, 4, 0, 1, 1, 7, 7, 29, 24, 41, 21, 1, 0, 1, 1, 8, 8, 41, 35, 91, 56, 34, 5, 0, 1, 1, 9, 9, 55, 48, 169, 115, 153, 55, 1, 0, 1, 1, 10, 10, 71, 63, 281, 204, 436, 209, 89, 6
Offset: 0

Views

Author

Kenneth J Ramsey, Jun 21 2011

Keywords

Comments

Column j=1 is the Fibonacci sequence A000045. Column 2 is A002530; column 4 is A041011; column 6 is A041023; column 8 is A041039, column 10 is A041059, column 12 is A041083, column 14 is A041111 corresponding the denominators of continued fraction convergents to square root of 3,8,15,24,35,48 and 63.
T(2*i-1,j)*T(2*i,j)^2*T(2*i+1,j)*j/2 appears to be always a triangular number, T(j*T(2*i,j)^2).
T(2*i,j)*T(2*i+1,j)^2*T(2*i+2)*j/2 appears to always equal a triangular number, T(j*T(2*i,j)*T(2*i+2,j)).
Conjecture re relation of A192062 to the sequence of primes: T(2*n,j) = A(n,j)*T(n,j) where A(n,j) is from the square array A191971. There, A(3*n,j) = A(n,j)*B(n,j) where B(n,j) are integers. It appears further that B(5*n,j)=B(n,j)*C(n,j); C(7*n,j)= C(n,j)*D(n,j); D(11*n,j) = D(n,j)*E(n,j); E(13*n,j) = E(n,j)*F(n,j) and F(17*n,j) = F(n,j)*G(n,j) where C(n,j), D(n,j) etc. are all integers. My conjecture is that this property continues indefinitely and follows the sequence of primes.

Examples

			Array as meant by the definition
First column has index j=0
0  0  0   0   0   0   0 ...
1  1  1   1   1   1   1 ...
1  1  1   1   1   1   1 ...
1  2  3   4   5   6   7 ...
2  3  4   5   6   7   8 ...
1  5 11  19  29  41  55 ...
3  8 15  24  35  48  63 ...
1 13 41  91 169 281 433 ...
4 21 56 115 204 329 496 ...
.
.
.
		

Crossrefs

Formula

Each column j is a recursive sequence defined by T(0,j)=0, T(1,j) = 1, T(2i,j)= T(2i-2,j)+T(2i-1,j) and T(2i+1,j) = T(2i-1,j)+j*T(2i,j). Also, T(n+2,j) = (j+2)*T(n,j)-T(n-2,j).
T(2n,j) = Sum(k=1 to n) C(k)*T(2*k,j-1) where the C(k) are the n-th row of the triangle A191579.
T(2*i,j) = T(i,j)*A(i,j) where A(i,j) is from the table A(i,j) of A191971.
T(4*i,j) = (T(2*i+1)^2 - T(2*i-1)^2)/j
T(4*i+2,j) = T(2*i+2,j)^2 - T(2*i,j)^2

Extensions

Corrected and edited by Olivier Gérard, Jul 05 2011
Showing 1-3 of 3 results.