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.

Previous Showing 11-19 of 19 results.

A081142 12th binomial transform of (0,0,1,0,0,0,...).

Original entry on oeis.org

0, 0, 1, 36, 864, 17280, 311040, 5225472, 83607552, 1289945088, 19349176320, 283787919360, 4086546038784, 57954652913664, 811365140791296, 11234286564802560, 154070215745863680, 2095354934143746048
Offset: 0

Views

Author

Paul Barry, Mar 08 2003

Keywords

Comments

Starting at 1, the three-fold convolution of A001021 (powers of 12).

Crossrefs

Cf. A001021.
Sequences similar to the form q^(n-2)*binomial(n, 2): A000217 (q=1), A001788 (q=2), A027472 (q=3), A038845 (q=4), A081135 (q=5), A081136 (q=6), A027474 (q=7), A081138 (q=8), A081139 (q=9), A081140 (q=10), A081141 (q=11), this sequence (q=12), A027476 (q=15).

Programs

  • GAP
    List([0..20],n->12^(n-2)*Binomial(n,2)); # Muniru A Asiru, Nov 24 2018
  • Magma
    [12^(n-2)* Binomial(n, 2): n in [0..20]]; // Vincenzo Librandi, Oct 16 2011
    
  • Maple
    seq(coeff(series(x^2/(1-12*x)^3,x,n+1), x, n), n = 0 .. 20); # Muniru A Asiru, Nov 24 2018
  • Mathematica
    LinearRecurrence[{36,-432,1728},{0,0,1},30] (* or *) Table[(n-1) (n-2) 3^(n-3) 2^(2n-7),{n,20}] (* Harvey P. Dale, Jul 25 2013 *)
  • PARI
    vector(20, n, n--; 2^(2*n-5)*3^(n-2)*n*(n-1)) \\ G. C. Greubel, Nov 23 2018
    
  • Sage
    [2^(2*n-5)*3^(n-2)*n*(n-1) for n in range(20)] # G. C. Greubel, Nov 23 2018
    

Formula

a(n) = 36*a(n-1) - 432*a(n-2) + 1728*a(n-3), a(0) = a(1) = 0, a(2) = 1.
a(n) = 12^(n-2)*binomial(n, 2).
G.f.: x^2/(1 - 12*x)^3.
a(n) = 2^(2*n-5)*3^(n-2)*n*(n-1). - Harvey P. Dale, Jul 25 2013
E.g.f.: (1/2)*exp(12*x)*x^2. - Franck Maminirina Ramaharo, Nov 23 2018
From Amiram Eldar, Jan 06 2022: (Start)
Sum_{n>=2} 1/a(n) = 24 - 264*log(12/11).
Sum_{n>=2} (-1)^n/a(n) = 312*log(13/12) - 24. (End)

A081144 Starting at 1, four-fold convolution of A000400 (powers of 6).

Original entry on oeis.org

0, 0, 0, 1, 24, 360, 4320, 45360, 435456, 3919104, 33592320, 277136640, 2217093120, 17293326336, 132058128384, 990435962880, 7313988648960, 53287631585280, 383670947414016, 2733655500324864, 19296391766999040, 135074742368993280
Offset: 0

Views

Author

Paul Barry, Mar 08 2003

Keywords

Comments

With a different offset, number of n-permutations (n=4) of 7 objects: t, u, v, w, z, x, y with repetition allowed, containing exactly three u's. Example: a(4)=24 because we have uuut, uutu, utuu, tuuu, uuuv, uuvu, uvuu, vuuu, uuuw, uuwu, uwuu, wuuu, uuuz, uuzu, uzuu, zuuu, uuux, uuxu, uxuu, xuuu, uuuy, uuyu, uyuu, yuuu. - Zerinvary Lajos, Jun 03 2008

Crossrefs

Programs

  • GAP
    List([-3..18],n->Binomial(n+3,3)*6^n); # Muniru A Asiru, Feb 19 2018
  • Magma
    [6^n* Binomial(n+3, 3): n in [-3..20]]; // Vincenzo Librandi, Oct 16 2011
    
  • Maple
    seq(seq(binomial(i+2, j)*6^(i-1), j =i-1), i=-2..19); # Zerinvary Lajos, Dec 30 2007
    seq(binomial(n+3,3)*6^n,n=-3..18); # Zerinvary Lajos, Jun 03 2008
  • Sage
    [lucas_number2(n, 6, 0)*binomial(n,3)/6^3 for n in range(0, 22)] # Zerinvary Lajos, Mar 13 2009
    

Formula

G.f.: x^3/(1 - 6*x)^4.
a(n) = 24*a(n-1) - 216*a(n-2) + 864*a(n-3) - 1296*a(n-4) for n > 3, a(0) = a(1) = a(2) = 0, a(3) = 1.
a(n) = 6^(n - 3)*binomial(n, 3).
From Amiram Eldar, Jan 04 2022: (Start)
Sum_{n>=3} 1/a(n) = 450*log(6/5) - 81.
Sum_{n>=3} (-1)^(n+1)/a(n) = 882*log(7/6) - 135. (End)

A081130 Square array of binomial transforms of (0,0,1,0,0,0,...), read by antidiagonals.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 3, 0, 0, 0, 1, 6, 6, 0, 0, 0, 1, 9, 24, 10, 0, 0, 0, 1, 12, 54, 80, 15, 0, 0, 0, 1, 15, 96, 270, 240, 21, 0, 0, 0, 1, 18, 150, 640, 1215, 672, 28, 0, 0, 0, 1, 21, 216, 1250, 3840, 5103, 1792, 36, 0, 0, 0, 1, 24, 294, 2160, 9375, 21504, 20412, 4608, 45, 0
Offset: 0

Views

Author

Paul Barry, Mar 08 2003

Keywords

Comments

Rows, of the square array, are three-fold convolutions of sequences of powers.

Examples

			The array begins as:
  0,  0,  0,   0,   0,    0, ...
  0,  0,  0,   0,   0,    0, ...
  0,  1,  1,   1,   1,    1, ... A000012
  0,  3,  6,   9,  12,   15, ... A008585
  0,  6, 24,  54,  96,  150, ... A033581
  0, 10, 80, 270, 640, 1250, ... A244729
The antidiagonal triangle begins as:
  0;
  0, 0;
  0, 0, 0;
  0, 0, 1, 0;
  0, 0, 1, 3,  0;
  0, 0, 1, 6,  6,  0;
  0, 0, 1, 9, 24, 10, 0;
		

Crossrefs

Main diagonal: A081131.
Rows: A000012 (n=2), A008585 (n=3), A033581 (n=4), A244729 (n=5).
Columns: A000217 (k=1), A001788 (k=2), A027472 (k=3), A038845 (k=4), A081135 (k=5), A081136 (k=6), A027474 (k=7), A081138 (k=8), A081139 (k=9), A081140 (k=10), A081141 (k=11), A081142 (k=12), A027476 (k=15).

Programs

  • Magma
    [k eq n select 0 else (n-k)^(k-2)*Binomial(k,2): k in [0..n], n in [0..12]]; // G. C. Greubel, May 14 2021
    
  • Mathematica
    Table[If[k==n, 0, (n-k)^(k-2)*Binomial[k, 2]], {n,0,12}, {k,0,n}]//Flatten (* G. C. Greubel, May 14 2021 *)
  • PARI
    T(n, k)=if (k==0, 0, k^(n-2)*binomial(n, 2));
    seq(nn) = for (n=0, nn, for (k=0, n, print1(T(k, n-k), ", ")); );
    seq(12) \\ Michel Marcus, May 14 2021
  • Sage
    flatten([[0 if (k==n) else (n-k)^(k-2)*binomial(k,2) for k in (0..n)] for n in (0..12)]) # G. C. Greubel, May 14 2021
    

Formula

T(n, k) = k^(n-2)*binomial(n, 2), with T(n, 0) = 0 (square array).
T(n, n) = A081131(n).
Rows have g.f. x^3/(1-k*x)^n.
From G. C. Greubel, May 14 2021: (Start)
T(k, n-k) = (n-k)^(k-2)*binomial(k,2) with T(n, n) = 0 (antidiagonal triangle).
Sum_{k=0..n} T(n, n-k) = A081197(n). (End)

Extensions

Term a(5) corrected by G. C. Greubel, May 14 2021

A172501 a(n) = binomial(n+8,8)*6^n.

Original entry on oeis.org

1, 54, 1620, 35640, 641520, 10007712, 140107968, 1801388160, 21616657920, 244988789760, 2645878929408, 27420927086592, 274209270865920, 2657720625315840, 25058508752977920, 230538280527396864, 2074844524746571776, 18307451688940339200, 158664581304149606400
Offset: 0

Views

Author

Zerinvary Lajos, Feb 05 2010

Keywords

Comments

With a different offset, number of n-permutations (n>=8) of 7 objects: r, s, t, u, v, z, x, y with repetition allowed, containing exactly eight (8) u's.

Crossrefs

Programs

  • Magma
    [6^n* Binomial(n+8, 8): n in [0..20]]; // Vincenzo Librandi, Oct 12 2011
    
  • Mathematica
    Table[Binomial[n + 8, 8]*6^n, {n, 0, 20}]
  • PARI
    Vec(1 / (1 - 6*x)^9 + O(x^30)) \\ Colin Barker, Jul 24 2017

Formula

From Colin Barker, Jul 24 2017: (Start)
G.f.: 1 / (1 - 6*x)^9.
a(n) = (2^(-7 + n)*3^(-2 + n)*(1 + n)*(2 + n)*(3 + n)*(4 + n)*(5 + n)*(6 + n)*(7 + n)*(8 + n)) / 35.
(End)
From Amiram Eldar, Aug 29 2022: (Start)
Sum_{n>=0} 1/a(n) = 4785948/7 - 3750000*log(6/5).
Sum_{n>=0} (-1)^n/a(n) = 39530064*log(7/6) - 213275484/35. (End)

A173123 a(n) = binomial(n+9,9)*6^n.

Original entry on oeis.org

1, 60, 1980, 47520, 926640, 15567552, 233513280, 3202467840, 40831464960, 489977579520, 5585744406528, 60935393525760, 639821632020480, 6496650417438720, 64038411257610240, 614768748073058304, 5763457013184921600, 52888193768049868800, 475993743912448819200
Offset: 0

Views

Author

Zerinvary Lajos, Feb 10 2010

Keywords

Comments

With a different offset, number of n-permutations (n>=9) of 7 objects: r, s, t, u, v, z, x, y with repetition allowed, containing exactly 9 u's.

Crossrefs

Programs

  • Magma
    [6^n* Binomial(n+9, 9): n in [0..20]]; // Vincenzo Librandi, Oct 12 2011
  • Mathematica
    Table[Binomial[n + 9, 9]*6^n, {n, 0, 20}]

Formula

a(n) = C(n + 9, 9)*6^n.
From Chai Wah Wu, Nov 12 2021: (Start)
a(n) = 60*a(n-1) - 1620*a(n-2) + 25920*a(n-3) - 272160*a(n-4) + 1959552*a(n-5) - 9797760*a(n-6) + 33592320*a(n-7) - 75582720*a(n-8) + 100776960*a(n-9) - 60466176*a(n-10) for n > 9.
G.f.: 1/(6*x - 1)^10. (End)
From Amiram Eldar, Aug 29 2022: (Start)
Sum_{n>=0} 1/a(n) = 21093750*log(6/5) - 107683641/28.
Sum_{n>=0} (-1)^n/a(n) = 311299254*log(7/6) - 959739813/20. (End)

A116164 a(n) = 6^n * n*(n+1).

Original entry on oeis.org

0, 12, 216, 2592, 25920, 233280, 1959552, 15676416, 120932352, 906992640, 6651279360, 47889211392, 339578044416, 2377046310912, 16456474460160, 112844396298240, 767341894828032, 5179557790089216, 34733505180598272
Offset: 0

Views

Author

Mohammad K. Azarian, Apr 08 2007

Keywords

Crossrefs

Programs

  • GAP
    List([0..30], n-> 6^n*n*(n+1) ); # G. C. Greubel, May 10 2019
  • Magma
    [(n^2+n)*6^n: n in [0..30]]; // Vincenzo Librandi, Feb 28 2013
    
  • Magma
    I:=[0,12,216]; [n le 3 select I[n] else 18*Self(n-1)-108*Self(n-2)+216*Self(n-3): n in [1..30]]; // Vincenzo Librandi, Feb 28 2013
    
  • Mathematica
    Table[(n^2 + n) 6^n, {n, 0, 30}] (* or *) CoefficientList[Series[12 x/(1 - 6 x)^3, {x, 0, 30}], x] (* Vincenzo Librandi, Feb 28 2013 *)
  • PARI
    a(n)=(n^2+n)*6^n \\ Charles R Greathouse IV, Feb 28 2013
    
  • Sage
    [6^n*n*(n+1) for n in (0..30)] # G. C. Greubel, May 10 2019
    

Formula

G.f.: 12*x/(1-6*x)^3. - Vincenzo Librandi, Feb 28 2013
a(n) = 18*a(n-1) - 108*a(n-2) + 216*a(n-3). - Vincenzo Librandi, Feb 28 2013
a(n) = 12*A081136(n+1). - Bruno Berselli, Feb 28 2013
E.g.f.: 12*x*(1 + 3*x)*exp(6*x). - G. C. Greubel, May 10 2019
From Amiram Eldar, Jul 20 2020: (Start)
Sum_{n>=1} 1/a(n) = 1 - 5*log(6/5).
Sum_{n>=1} (-1)^(n+1)/a(n) = 7*log(7/6) - 1. (End)

A128800 a(n) = n*(n-1)*6^n.

Original entry on oeis.org

0, 0, 72, 1296, 15552, 155520, 1399680, 11757312, 94058496, 725594112, 5441955840, 39907676160, 287335268352, 2037468266496, 14262277865472, 98738846760960, 677066377789440, 4604051368968192, 31077346740535296, 208401031083589632, 1389340207223930880, 9213519268958699520
Offset: 0

Views

Author

Mohammad K. Azarian, Apr 07 2007

Keywords

Crossrefs

Programs

  • Magma
    [(n^2-n)*6^n: n in [0..25]]; // Vincenzo Librandi, Feb 11 2013
  • Mathematica
    CoefficientList[Series[72 x^2/(1 - 6 x)^3, {x, 0, 30}], x] (* Vincenzo Librandi, Feb 11 2013 *)
    LinearRecurrence[{18,-108,216},{0,0,72},30] (* Harvey P. Dale, Mar 22 2018 *)

Formula

G.f.: 72*x^2/(1 - 6*x)^3. - Vincenzo Librandi, Feb 11 2013
a(n) = 72*A081136(n). - R. J. Mathar, Apr 26 2015
a(n) = 18*a(n-1) - 108*a(n-2) + 216*a(n-3). - Wesley Ivan Hurt, Jan 20 2024
From Amiram Eldar, Apr 04 2025: (Start)
Sum_{n>=2} 1/a(n) = 1/6 - (5/6)*log(6/5).
Sum_{n>=2} (-1)^n/a(n) = (7/6)*log(7/6) - 1/6. (End)

A173124 a(n) = binomial(n+10,10)*6^n.

Original entry on oeis.org

1, 66, 2376, 61776, 1297296, 23351328, 373621248, 5444195328, 73496636928, 930957401088, 11171488813056, 127964326404096, 1407607590445056, 14942295960109056, 153692187018264576, 1536921870182645760, 14984988234280796160, 142798123173734645760, 1332782482954856693760
Offset: 0

Views

Author

Zerinvary Lajos, Feb 10 2010

Keywords

Comments

With a different offset, number of n-permutations (n>=10) of 7 objects: r, s, t, u, v, z, x, with repetition allowed, containing exactly 10 u's.

Crossrefs

Programs

  • Magma
    [6^n* Binomial(n+10, 10): n in [0..20]]; // Vincenzo Librandi, Oct 12 2011
  • Mathematica
    Table[Binomial[n + 10, 10]*6^n, {n, 0, 20}]

Formula

From Chai Wah Wu, Nov 12 2021: (Start)
a(n) = 66*a(n-1) - 1980*a(n-2) + 35640*a(n-3) - 427680*a(n-4) + 3592512*a(n-5) - 21555072*a(n-6) + 92378880*a(n-7) - 277136640*a(n-8) + 554273280*a(n-9) - 665127936*a(n-10) + 362797056*a(n-11) for n > 10.
G.f.: -1/(6*x - 1)^11. (End)
From Amiram Eldar, Sep 04 2022: (Start)
Sum_{n>=0} 1/a(n) = 897363955/42 - 117187500*log(6/5).
Sum_{n>=0} (-1)^n/a(n) = 2421216420*log(7/6) - 2239392937/6. (End)

A304255 Triangle read by rows: T(0,0) = 1; T(n,k) = 6*T(n-1,k) + T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0.

Original entry on oeis.org

1, 6, 36, 1, 216, 12, 1296, 108, 1, 7776, 864, 18, 46656, 6480, 216, 1, 279936, 46656, 2160, 24, 1679616, 326592, 19440, 360, 1, 10077696, 2239488, 163296, 4320, 30, 60466176, 15116544, 1306368, 45360, 540, 1, 362797056, 100776960, 10077696, 435456, 7560, 36
Offset: 0

Views

Author

Zagros Lalo, May 09 2018

Keywords

Comments

The numbers in rows of the triangle are along skew diagonals pointing top-left in center-justified triangle given in A013613 ((1+6*x)^n).
The coefficients in the expansion of 1/(1-6x-x^2) are given by the sequence generated by the row sums.
The row sums are Denominators of continued fraction convergent to sqrt(10), see A005668.
If s(n) is the row sum at n, then the ratio s(n)/s(n-1) is approximately 6.162277660..., a metallic mean (see A176398), when n approaches infinity.

Examples

			Triangle begins:
1;
6;
36, 1;
216, 12;
1296, 108, 1;
7776, 864, 18;
46656, 6480, 216, 1;
279936, 46656, 2160, 24;
1679616, 326592, 19440, 360, 1;
10077696, 2239488, 163296, 4320, 30;
60466176, 15116544, 1306368, 45360, 540, 1;
362797056, 100776960, 10077696, 435456, 7560, 36;
2176782336, 665127936, 75582720, 3919104, 90720, 756, 1;
13060694016, 4353564672, 554273280, 33592320, 979776, 12096, 42;
78364164096, 28298170368, 3990767616, 277136640, 9797760, 163296, 1008, 1;
470184984576, 182849716224, 28298170368, 2217093120, 92378880, 1959552, 18144, 48;
		

References

  • Shara Lalo and Zagros Lalo, Polynomial Expansion Theorems and Number Triangles, Zana Publishing, 2018, ISBN: 978-1-9995914-0-3, pp. 70, 72, 94.

Crossrefs

Row sums give A005668.
Cf. A000400 (column 0), A053469 (column 1), A081136 (column 2), A081144 (column 3).
Cf. A013613.
Cf. A176398.

Programs

  • Mathematica
    t[0, 0] = 1; t[n_, k_] := If[n < 0 || k < 0, 0, 6 t[n - 1, k] + t[n - 2, k - 1]]; Table[t[n, k], {n, 0, 11}, {k, 0, Floor[n/2]}] // Flatten
  • PARI
    T(n, k) = if ((n<0) || (k<0), 0, if ((n==0) && (k==0), 1, 6*T(n-1, k) + T(n-2, k-1)));
    tabf(nn) = for (n=0, nn, for (k=0, n\2, print1(T(n,k), ", ")); print); \\ Michel Marcus, May 26 2018
Previous Showing 11-19 of 19 results.