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.

A154355 a(n) = 25*n^2 - 36*n + 13.

Original entry on oeis.org

13, 2, 41, 130, 269, 458, 697, 986, 1325, 1714, 2153, 2642, 3181, 3770, 4409, 5098, 5837, 6626, 7465, 8354, 9293, 10282, 11321, 12410, 13549, 14738, 15977, 17266, 18605, 19994, 21433, 22922, 24461, 26050, 27689, 29378
Offset: 0

Views

Author

Vincenzo Librandi, Jan 07 2009

Keywords

Comments

The identity (1250*n^2 - 1800*n + 649)^2 - (25*n^2 - 36*n + 13)*(250*n - 180)^2 = 1 can be written as A154358(n)^2 - a(n)*A154360(n)^2 = 1. See also the third comment in A154357.
Numbers of the form (3n-2)^2 + (4n-3)^2. - Bruno Berselli, Dec 12 2011
From Klaus Purath, May 06 2025: (Start)
25*a(n)-1 is a square, and a(n) is the sum of two squares (see FORMULA). There are no squares in this sequence. The odd 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*(5*y)^2 = -1 for any integer n where a(1-n) = A154357(n). The values for k and the solutions x, y can be calculated using the following algorithm: k = sqrt(D*5^2 - 1), x(0) = 1, x(1) = 4*D*5^2 - 1, y(0) = 1, y(1) = 4*D*5^2 - 3. The two recurrences are of the form (4*D*5^2 - 2, -1).
It follows from the above that the terms of this sequence and of A154357 belong to A031396. (End)

Crossrefs

Essentially a duplicate of A007533.

Programs

  • Magma
    [25*n^2-36*n+13: n in [0..40]]; // Bruno Berselli, Sep 15 2016
  • Mathematica
    Table[25n^2-36n+13,{n,0,40}]  (* Harvey P. Dale, Apr 02 2011 *)
    LinearRecurrence[{3, -3, 1}, {13, 2, 41}, 50] (* Vincenzo Librandi, Feb 21 2012 *)
  • PARI
    for(n=0, 40, print1(25*n^2 - 36*n + 13", ")); \\ Vincenzo Librandi, Feb 21 2012
    

Formula

a(n) = A007533(n-1), n>0. - R. J. Mathar, Jan 14 2009
G.f.: (13 - 37*x + 74*x^2) / (1-x)^3. - R. J. Mathar, Jan 05 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Feb 21 2012
E.g.f.: (13 - 11*x + 25*x^2) * exp(x). - G. C. Greubel, Sep 14 2016
From Klaus Purath, May 06 2025: (Start)
a(n) = (3*n-2)^2 + (4*n-3)^2.
25*a(n) - 1 = (25*n - 18)^2. (End)

Extensions

Offset corrected from R. J. Mathar, Jan 05 2011
First comment rewritten by Bruno Berselli, Dec 12 2011

A161587 a(n) = 13*n^2 + 10*n + 1.

Original entry on oeis.org

1, 24, 73, 148, 249, 376, 529, 708, 913, 1144, 1401, 1684, 1993, 2328, 2689, 3076, 3489, 3928, 4393, 4884, 5401, 5944, 6513, 7108, 7729, 8376, 9049, 9748, 10473, 11224, 12001, 12804, 13633, 14488, 15369, 16276, 17209, 18168, 19153, 20164
Offset: 0

Views

Author

Pierre Gayet, Jun 14 2009

Keywords

Comments

The defining formula can be regarded as an approximation and simplification of the expansion / propagation of native hydrophytes on the surface of stagnant waters in orthogonal directions; absence of competition / concurrence and of retrogression is assumed, mortality is taken into account. - [Translation of a comment in French sent by Pierre Gayet]

Crossrefs

Programs

  • Magma
    [ 13*n^2+10*n+1: n in [0..50] ];
    
  • Mathematica
    Table[13n^2+10n+1,{n,0,40}] (* or *) LinearRecurrence[{3,-3,1},{1,24,73},40] (* Harvey P. Dale, Nov 06 2014 *)
  • PARI
    a(n)=13*n^2+10*n+1 \\ Charles R Greathouse IV, Oct 07 2015

Formula

a(n) = a(n-1) + 26*n - 3 (with a(0)=1). - Vincenzo Librandi, Nov 30 2010
From Bruno Berselli, Dec 12 2011: (Start)
G.f.: (1 + 21*x + 4*x^2)/(1-x)^3.
a(n-1) = A202141(n) - 1 with a(-1)=4. (End)
E.g.f.: exp(x)*(1 + 23*x + 13*x^2). - Stefano Spezia, Oct 21 2024

A190816 a(n) = 5*n^2 - 4*n + 1.

Original entry on oeis.org

1, 2, 13, 34, 65, 106, 157, 218, 289, 370, 461, 562, 673, 794, 925, 1066, 1217, 1378, 1549, 1730, 1921, 2122, 2333, 2554, 2785, 3026, 3277, 3538, 3809, 4090, 4381, 4682, 4993, 5314, 5645, 5986, 6337, 6698, 7069, 7450, 7841, 8242, 8653, 9074
Offset: 0

Views

Author

Keywords

Comments

For n >= 2, hypotenuses of primitive Pythagorean triangles with m = 2*n-1, where the sides of the triangle are a = m^2 - n^2, b = 2*n*m, c = m^2 + n^2; this sequence is the c values, short sides (a) are A045944(n-1), and long sides (b) are A002939(n).

Crossrefs

Short sides (a) A045944(n-1), long sides (b) A002939(n).
Cf. A017281 (first differences), A051624 (a(n)-1), A202141.
Sequences of the form m*n^2 - 4*n + 1: -A131098 (m=0), A028872 (m=1), A056220 (m=2), A045944 (m=3), A016754 (m=4), this sequence (m=5), A126587 (m=6), A339623 (m=7), A080856 (m=8).

Programs

  • Magma
    [5*n^2 - 4*n + 1: n in [0..50]]; // Vincenzo Librandi, Jun 19 2011
    
  • Mathematica
    Table[5*n^2 - 4*n + 1, {n, 0, 100}]
    LinearRecurrence[{3,-3,1},{1,2,13},100] (* or *) CoefficientList[ Series[ (-10 x^2+x-1)/(x-1)^3,{x,0,100}],x] (* Harvey P. Dale, May 24 2011 *)
  • PARI
    a(n)=5*n^2-4*n+1 \\ Charles R Greathouse IV, Oct 16 2015
    
  • SageMath
    [5*n^2-4*n+1 for n in range(41)] # G. C. Greubel, Dec 03 2023

Formula

From Harvey P. Dale, May 24 2011: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3); a(0)=1, a(1)=2, a(2)=13.
G.f.: (1 - x + 10*x^2)/(1-x)^3. (End)
E.g.f.: (1 + x + 5*x^2)*exp(x). - G. C. Greubel, Dec 03 2023

Extensions

Edited by Franklin T. Adams-Watters, May 20 2011
Showing 1-3 of 3 results.