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.

A155724 Triangle read by rows: T(n, k) = 2*n*k + n + k - 4.

Original entry on oeis.org

0, 3, 8, 6, 13, 20, 9, 18, 27, 36, 12, 23, 34, 45, 56, 15, 28, 41, 54, 67, 80, 18, 33, 48, 63, 78, 93, 108, 21, 38, 55, 72, 89, 106, 123, 140, 24, 43, 62, 81, 100, 119, 138, 157, 176, 27, 48, 69, 90, 111, 132, 153, 174, 195, 216, 30, 53, 76, 99, 122, 145, 168, 191, 214, 237, 260
Offset: 1

Views

Author

Vincenzo Librandi, Jan 25 2009

Keywords

Examples

			Triangle begins:
   0;
   3,  8;
   6, 13, 20;
   9, 18, 27, 36;
  12, 23, 34, 45,  56;
  15, 28, 41, 54,  67,  80;
  18, 33, 48, 63,  78,  93, 108;
  21, 38, 55, 72,  89, 106, 123, 140;
  24, 43, 62, 81, 100, 119, 138, 157, 176;
  27, 48, 69, 90, 111, 132, 153, 174, 195, 216;

Links

Crossrefs

All terms are in A155723.
Cf. A008585, A016885, A017053, A020705, A154685, A155722.
Cf. A162261 (row sums).
Columns k: A008585 (k=1), A016885 (k=2), A017053 (k=3), 9*A020705 (k=4).
Diagonals include: A139570, A181510, A271625.

Programs

  • Magma
    /* Triangle: */ [[2*m*n+m+n-4: m in [1..n]]: n in [1..10]]; // Bruno Berselli, Aug 31 2012
  • Mathematica
    Flatten[Table[2 n m + m + n - 4, {n, 10}, {m, n}]] (* Vincenzo Librandi, Mar 01 2012 *)
  • Python
    def A155724(n,k): return 2*n*k+n+k-4
print(flatten([[A155724(n,k) for k in range(1,n+1)] for n in range(1,16)])) # G. C. Greubel, Jan 21 2025

Formula

T(n, k) = A154685(n, k) - 8. - L. Edson Jeffery, Oct 12 2012
2*T(n, k) + 9 = (2*k+1)*(2*n+1). - Vincenzo Librandi, Nov 18 2012
From G. C. Greubel, Jan 21 2025: (Start)
T(2*n-1, n) = 4*n^2 + n - 5 (main diagonal).
Sum_{k=1..n} (-1)^(k-1)*T(n, k) = (1/4)*( 4*(-1)^(n+1)*n^2 + 2*(2-3*(-1)^n)*n - 7*(1-(-1)^n)).
G.f.: x*y*(3*x + 3*y - 4*x*y)/((1-x)*(1-y))^2. (End)

Extensions

Edited by N. J. A. Sloane, Jun 23 2010

A151675 Row sums of A154685.

Original entry on oeis.org

8, 27, 63, 122, 210, 333, 497, 708, 972, 1295, 1683, 2142, 2678, 3297, 4005, 4808, 5712, 6723, 7847, 9090, 10458, 11957, 13593, 15372, 17300, 19383, 21627, 24038, 26622, 29385, 32333, 35472, 38808, 42347, 46095, 50058, 54242, 58653, 63297
Offset: 1

Views

Author

N. J. A. Sloane, May 31 2009

Keywords

Links

Crossrefs

Cf. A154685, A162261.

Programs

  • Magma
    I:=[8, 27, 63, 122]; [n le 4 select I[n] else 4*Self(n-1)-6*Self(n-2)+4*Self(n-3)-Self(n-4): n in [1..50]]; // Vincenzo Librandi, Jun 30 2012
  • Mathematica
    CoefficientList[Series[(8-5*x+3*x^2)/(1-x)^4,{x,0,40}],x] (* Vincenzo Librandi, Jun 30 2012 *)
  • Python
    def A151675(n): return n*(2*n**2 +5*n+9)//2
print([A151675(n) for n in range(1,51)]) # G. C. Greubel, Jan 21 2025

Formula

From R. J. Mathar, May 31 2009: (Start)
a(n) = n*(2*n^2 + 5*n + 9)/2.
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4).
G.f.: x*(8 - 5*x + 3*x^2)/(1-x)^4. (End)
a(n) = A162261(n) + 8*n. - L. Edson Jeffery, Oct 12 2012
E.g.f.: (1/2)*x*(16 + 11*x + 2*x^2)*exp(x). - G. C. Greubel, Jan 21 2025

Extensions

Extended by R. J. Mathar, May 31 2009

A302537 a(n) = (n^2 + 13*n + 2)/2.

Original entry on oeis.org

1, 8, 16, 25, 35, 46, 58, 71, 85, 100, 116, 133, 151, 170, 190, 211, 233, 256, 280, 305, 331, 358, 386, 415, 445, 476, 508, 541, 575, 610, 646, 683, 721, 760, 800, 841, 883, 926, 970, 1015, 1061, 1108, 1156, 1205, 1255, 1306, 1358, 1411, 1465, 1520, 1576
Offset: 0

Views

Author

Franck Maminirina Ramaharo, Apr 09 2018

Keywords

Comments

Binomial transform of [1, 7, 1, 0, 0, 0, ...].
Numbers m > 0 such that 8*m + 161 is a square.

Examples

			Illustration of initial terms (by the formula a(n) = A052905(n) + 3*n):
.                                                                    o
.                                                                  o o
.                                                    o           o o o
.                                                  o o         o o o o
.                                      o         o o o       o o o o o
.                                    o o       o o o o     o o o o o o
.                          o       o o o     o o o o o   o . . . . . o
.                        o o     o o o o   o . . . . o   o . . . . . o
.                o     o o o   o . . . o   o . . . . o   o . . . . . o
.              o o   o . . o   o . . . o   o . . . . o   o . . . . . o
.        o   o . o   o . . o   o . . . o   o . . . . o   o . . . . . o
.      o o   o . o   o . . o   o . . . o   o . . . . o   o . . . . . o
.  o   o o   o o o   o o o o   o o o o o   o o o o o o   o o o o o o o
.        o     o o     o o o     o o o o     o o o o o     o o o o o o
.        o     o o     o o o     o o o o     o o o o o     o o o o o o
.        o     o o     o o o     o o o o     o o o o o     o o o o o o
----------------------------------------------------------------------
.  1     8      16        25          35            46              58

References

  • R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics: A Foundation for Computer Science, Addison-Wesley, 1994.

Links

Crossrefs

Sequences whose n-th terms are of the form binomial(n, 2) + n*k + 1:
A152947 (k = 0); A000124 (k = 1); A000217 (k = 2); A034856 (k = 3);
A052905 (k = 4); A051936 (k = 5); A246172 (k = 6).
Cf. A000578, A002939, A004120, A008589, A056119, A060544, A162261.

Programs

  • Magma
    A302537:= func< n | ((n+1)^2 +12*n +1)/2 >;
[A302537(n): n in [0..50]]; // G. C. Greubel, Jan 21 2025
  • Maple
    a := n -> (n^2 + 13*n + 2)/2;
seq(a(n), n = 0 .. 100);
  • Mathematica
    Table[(n^2 + 13 n + 2)/2, {n, 0, 100}]
CoefficientList[ Series[(5x^2 - 5x - 1)/(x - 1)^3, {x, 0, 50}], x] (* or *)
LinearRecurrence[{3, -3, 1}, {1, 8, 16}, 51] (* Robert G. Wilson v, May 19 2018 *)
  • Maxima
    makelist((n^2 + 13*n + 2)/2, n, 0, 100);
  • PARI
    a(n) = (n^2 + 13*n + 2)/2; \\ Altug Alkan, Apr 12 2018
  • Python
    def A302537(n): return (n**2 + 13*n + 2)//2
print([A302537(n) for n in range(51)]) # G. C. Greubel, Jan 21 2025

Formula

a(n) = binomial(n + 1, 2) + 6*n + 1 = binomial(n, 2) + 7*n + 1.
a(n) = a(n-1) + n + 6.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n >= 3, where a(0) = 1, a(1) = 8 and a(2) = 16.
a(n) = 2*a(n-1) - a(n-2) + 1.
a(n) = A004120(n+1) for n > 1.
a(n) = A056119(n) + 1.
a(n) = A152947(n+1) + A008589(n).
a(n) = A060544(n+1) - A002939(n).
a(n) = A000578(n+1) - A162261(n) for n > 0.
G.f.: (1 + 5*x - 5*x^2)/(1 - x)^3.
E.g.f.: (1/2)*(2 + 14*x + x^2)*exp(x).
Sum_{n>=0} 1/a(n) = 24097/45220 + 2*Pi*tan(sqrt(161)*Pi/2) / sqrt(161) = 1.4630922534498496... - Vaclav Kotesovec, Apr 11 2018
Showing 1-3 of 3 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.