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-2 of 2 results.

A055979 Solutions (value of r) of the Diophantine equation 2*x^2 + 3*x + 2 = r^2.

Original entry on oeis.org

4, 11, 134, 373, 4552, 12671, 154634, 430441, 5253004, 14622323, 178447502, 496728541, 6061962064, 16874148071, 205928262674, 573224305873, 6995498968852, 19472752251611, 237641036678294, 661500352248901, 8072799748093144, 22471539224211023
Offset: 0

Views

Author

Helge Robitzsch (hrobi(AT)math.uni-goettingen.de), Jul 24 2000

Keywords

Comments

A necessary condition on any solution of the equation is x = [r/sqrt(2)] where [] denotes the floor function. The sequence lists the radii of circles for which a "best" digital approximation, as drawn by Bresenham-like algorithms, contains a point sequence [(x-1,x), (x,x), (x,x-1)] that is multiply connected by king moves. - clarified by M. Douglas McIlroy, May 18 2015
Corresponding values of x for above equation are given by A056161(n). The numbers a(n) are also solutions (value of r) to the Diophantine equation: 2x^2 - x + 1 = r^2, (excluding r = 1 at x = 0). - Richard R. Forberg, Nov 24 2013
This sequence lists the degrees n of those Chebyshev polynomials T(n,x) of the first kind which have the following exceptional property: There are exactly two coefficients in the power form of T(n,x) whose absolute values are identical and coincide with the height of T(n,x). This property is exceptional because for all remaining degrees n there is only one coefficient in the power form of T(n,x) whose absolute value coincides with the height of T(n,x). Recall that the height of a polynomial in power form is the maximum of the absolute value of its coefficients. Example: T(4,x) = 1 - 8x^2 + 8x^4; T(11,x) = - 11x + 220x^3 - 1232x^5 + 2816x^7 - 2816x^9 + 1024x^11. - Heinz-Joachim Rack, Nov 14 2015

References

  • H.-J. Rack, On the length and height of Chebyshev polynomials in one and two variables, East Journal on Approximations, 16 (2010), 35 - 91. See Theorem 5.2.1, Remark (k), and Table 5.

Links

Crossrefs

Cf. A006452.

Programs

  • Magma
    I:=[4,11,134,373]; [n le 4 select I[n] else 34*Self(n-2)-Self(n-4): n in [1..30]]; // Vincenzo Librandi, May 19 2015
  • Maple
    a:= n-> (Matrix([11,4,1,2]). Matrix([[0,1,0,0], [34,0,1,0], [0,0,0,1], [ -1,0,0,0]])^n)[1,2]: seq(a(n), n=0..25); # Alois P. Heinz, Jun 03 2009
  • Mathematica
    LinearRecurrence[{0,34,0,-1},{4,11,134,373},20] (* Harvey P. Dale, Feb 21 2012 *)
  • PARI
    Vec((4+11*x-2*x^2-x^3)/(1+x^4-34*x^2) + O(x^50)) \\ Altug Alkan, Nov 15 2015

Formula

a(n) = A006452(2n+3) if n=0, 2, 4, ... a(n) = A006452(2n+2) if n=1, 3, 5, ...
G.f.: (4+11*x-2*x^2-x^3) / (1+x^4-34*x^2). - Alois P. Heinz, Jun 03 2009
a(n) = 34*a(n-2) - a(n-4); a(0)=4, a(1)=11, a(2)=134, a(3)=373. - Harvey P. Dale, Feb 21 2012

Extensions

More terms from Alois P. Heinz, Jun 03 2009

A133217 Indices of decagonal numbers (A001107) that are also triangular (A000217).

Original entry on oeis.org

0, 1, 2, 20, 55, 667, 1856, 22646, 63037, 769285, 2141390, 26133032, 72744211, 887753791, 2471161772, 30157495850, 83946756025, 1024467105097, 2851718543066, 34801724077436, 96874483708207, 1182234151527715, 3290880727535960, 40161159427864862
Offset: 1

Views

Author

Richard Choulet, Oct 11 2007; Ant King, Nov 04 2011

Keywords

Comments

For n>0, a(n) = (A055979(n) - A056161(n))/2, with those two sequences related through the Diophantine equation 2x^2 + 3x + 2 = r^2. - Richard R. Forberg, Nov 24 2013

Examples

			The third number which is both decagonal (A001107) and triangular (A000217) is A133216(3)=10. As this is the second decagonal number, we have a(3) = 2.

Links

Crossrefs

Cf. A000217, A001107, A077443, A077442, A133216, A133218.

Programs

  • Mathematica
    LinearRecurrence[{1, 34, -34, -1, 1} , {0, 1, 2, 20, 55, 667}, 24] (* first term 0 corrected by Georg Fischer, Apr 02 2019 *)

Formula

For n>5, a(n) = 34*a(n-2) - a(n-4) - 12.
For n>6, a(n) = a(n-1) + 34*a(n-2) - 34*a(n-3) - a(n-4) + a(n-5).
For n>1, a(n) = 1/16 * ((2*sqrt(2) + (-1)^n)*(1 + sqrt(2))^(2*n - 3) - (2*sqrt(2) - (-1)^n)*(1 - sqrt(2))^(2*n - 3) + 6).
For n>1, a(n) = ceiling (1/16*(2*sqrt(2) + (-1)^n)*(1 + sqrt(2))^(2*n - 3)).
G.f.: ( 1 - 33*x^2 + 18*x^3 + 2*x^4 ) / ((1 - x ) * (1 - 6*x + x^2 ) * (1 + 6*x + x^2)).
lim (n -> Infinity, a(2n+1)/a(2n)) = 1/7*(43 + 30*sqrt(2)).
lim (n -> Infinity, a(2n)/a(2n-1)) = 1/7*(11 + 6*sqrt(2)).

Extensions

Entry revised by Max Alekseyev, Nov 06 2011
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.