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.

A002783 a(n) = 2*(3^n - 2^n) + 1.

Original entry on oeis.org

1, 3, 11, 39, 131, 423, 1331, 4119, 12611, 38343, 116051, 350199, 1054691, 3172263, 9533171, 28632279, 85962371, 258018183, 774316691, 2323474359, 6971471651, 20916512103, 62753730611, 188269580439, 564825518531, 1694510110023, 5083597438931, 15250926534519
Offset: 0

Views

Author

Keywords

Comments

Binomial transform of A095121. - R. J. Mathar, Oct 05 2012
Create a triangle having its left and right border both equal to the n-th row of Pascal's triangle, and internal terms m(i,j) = m(i-1,j-1) + m(i-1,j). Then the sum of all elements equals a(n). - J. M. Bergot, Oct 07 2012, edited by M. F. Hasler, Oct 10 2012
First differences of A090326 (with offset 1). - Wesley Ivan Hurt, Jul 08 2014

Examples

			From _J. M. Bergot_ and _M. F. Hasler_, Oct 10 2012: (Start)
For n=3, the triangle with left and right border (1,3,3,1) and internal terms m(i,j) = m(i-1,j-1) + m(i-1,j) is
     1
    3 3
   3 6 3
  1 9 9 1
and the sum of all the elements is 39 = a(3). (End)
		

References

  • H. Gupta, On a problem in parity, Indian J. Math., 11 (1969), 157-163.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

Formula

G.f.: ( -1+3*x-4*x^2 ) / ( (x-1)*(3*x-1)*(2*x-1) ). - Simon Plouffe in his 1992 dissertation
a(n+1) - a(n) = 2*A027649(n). - R. J. Mathar, Oct 05 2012
E.g.f.: exp(x)*(1 - 2*exp(x) + 2*exp(2*x)). - Stefano Spezia, May 18 2024

Extensions

More terms from Wesley Ivan Hurt, Jul 08 2014