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.

A213782 Principal diagonal of the convolution array A213781.

Original entry on oeis.org

1, 7, 19, 41, 72, 118, 176, 254, 347, 465, 601, 767, 954, 1176, 1422, 1708, 2021, 2379, 2767, 3205, 3676, 4202, 4764, 5386, 6047, 6773, 7541, 8379, 9262, 10220, 11226, 12312, 13449, 14671, 15947, 17313, 18736, 20254, 21832, 23510, 25251, 27097, 29009, 31031
Offset: 1

Views

Author

Clark Kimberling, Jun 22 2012

Keywords

Crossrefs

Programs

  • Mathematica
    (See A213781.)
    LinearRecurrence[{2,1,-4,1,2,-1},{1,7,19,41,72,118},50] (* Harvey P. Dale, Oct 17 2016 *)
  • PARI
    Vec(x*(1+5*x+4*x^2-2*x^4)/((1-x)^4*(1+x)^2) + O(x^100)) \\ Colin Barker, Jan 31 2016

Formula

a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + a(n-4) + 2*a(n-5) - a(n-6).
G.f.: x*(1+5*x+4*x^2-2*x^4) / ((1-x)^4*(1+x)^2). - Corrected by Colin Barker, Jan 31 2016
From Colin Barker, Jan 31 2016: (Start)
a(n) = (16*n^3+66*n^2+6*(-1)^n*n-34*n-3*(-1)^n+3)/48.
a(n) = (8*n^3+33*n^2-14*n)/24 for n even.
a(n) = (8*n^3+33*n^2-20*n+3)/24 for n odd.
(End)

A213500 Rectangular array T(n,k): (row n) = b**c, where b(h) = h, c(h) = h + n - 1, n >= 1, h >= 1, and ** = convolution.

Original entry on oeis.org

1, 4, 2, 10, 7, 3, 20, 16, 10, 4, 35, 30, 22, 13, 5, 56, 50, 40, 28, 16, 6, 84, 77, 65, 50, 34, 19, 7, 120, 112, 98, 80, 60, 40, 22, 8, 165, 156, 140, 119, 95, 70, 46, 25, 9, 220, 210, 192, 168, 140, 110, 80, 52, 28, 10, 286, 275, 255, 228, 196, 161, 125, 90
Offset: 1

Views

Author

Clark Kimberling, Jun 14 2012

Keywords

Comments

Principal diagonal: A002412.
Antidiagonal sums: A002415.
Row 1: (1,2,3,...)**(1,2,3,...) = A000292.
Row 2: (1,2,3,...)**(2,3,4,...) = A005581.
Row 3: (1,2,3,...)**(3,4,5,...) = A006503.
Row 4: (1,2,3,...)**(4,5,6,...) = A060488.
Row 5: (1,2,3,...)**(5,6,7,...) = A096941.
Row 6: (1,2,3,...)**(6,7,8,...) = A096957.
...
In general, the convolution of two infinite sequences is defined from the convolution of two n-tuples: let X(n) = (x(1),...,x(n)) and Y(n)=(y(1),...,y(n)); then X(n)**Y(n) = x(1)*y(n)+x(2)*y(n-1)+...+x(n)*y(1); this sum is the n-th term in the convolution of infinite sequences:(x(1),...,x(n),...)**(y(1),...,y(n),...), for all n>=1.
...
In the following guide to related arrays and sequences, row n of each array T(n,k) is the convolution b**c of the sequences b(h) and c(h+n-1). The principal diagonal is given by T(n,n) and the n-th antidiagonal sum by S(n). In some cases, T(n,n) or S(n) differs in offset from the listed sequence.
b(h)........ c(h)........ T(n,k) .. T(n,n) .. S(n)
h .......... h .......... A213500 . A002412 . A002415
h .......... h^2 ........ A212891 . A213436 . A024166
h^2 ........ h .......... A213503 . A117066 . A033455
h^2 ........ h^2 ........ A213505 . A213546 . A213547
h .......... h*(h+1)/2 .. A213548 . A213549 . A051836
h*(h+1)/2 .. h .......... A213550 . A002418 . A005585
h*(h+1)/2 .. h*(h+1)/2 .. A213551 . A213552 . A051923
h .......... h^3 ........ A213553 . A213554 . A101089
h^3 ........ h .......... A213555 . A213556 . A213547
h^3 ........ h^3 ........ A213558 . A213559 . A213560
h^2 ........ h*(h+1)/2 .. A213561 . A213562 . A213563
h*(h+1)/2 .. h^2 ........ A213564 . A213565 . A101094
2^(h-1) .... h .......... A213568 . A213569 . A047520
2^(h-1) .... h^2 ........ A213573 . A213574 . A213575
h .......... Fibo(h) .... A213576 . A213577 . A213578
Fibo(h) .... h .......... A213579 . A213580 . A053808
Fibo(h) .... Fibo(h) .... A067418 . A027991 . A067988
Fibo(h+1) .. h .......... A213584 . A213585 . A213586
Fibo(n+1) .. Fibo(h+1) .. A213587 . A213588 . A213589
h^2 ........ Fibo(h) .... A213590 . A213504 . A213557
Fibo(h) .... h^2 ........ A213566 . A213567 . A213570
h .......... -1+2^h ..... A213571 . A213572 . A213581
-1+2^h ..... h .......... A213582 . A213583 . A156928
-1+2^h ..... -1+2^h ..... A213747 . A213748 . A213749
h .......... 2*h-1 ...... A213750 . A007585 . A002417
2*h-1 ...... h .......... A213751 . A051662 . A006325
2*h-1 ...... 2*h-1 ...... A213752 . A100157 . A071238
2*h-1 ...... -1+2^h ..... A213753 . A213754 . A213755
-1+2^h ..... 2*h-1 ...... A213756 . A213757 . A213758
2^(n-1) .... 2*h-1 ...... A213762 . A213763 . A213764
2*h-1 ...... Fibo(h) .... A213765 . A213766 . A213767
Fibo(h) .... 2*h-1 ...... A213768 . A213769 . A213770
Fibo(h+1) .. 2*h-1 ...... A213774 . A213775 . A213776
Fibo(h) .... Fibo(h+1) .. A213777 . A001870 . A152881
h .......... 1+[h/2] .... A213778 . A213779 . A213780
1+[h/2] .... h .......... A213781 . A213782 . A005712
1+[h/2] .... [(h+1)/2] .. A213783 . A213759 . A213760
h .......... 3*h-2 ...... A213761 . A172073 . A002419
3*h-2 ...... h .......... A213771 . A213772 . A132117
3*h-2 ...... 3*h-2 ...... A213773 . A214092 . A213818
h .......... 3*h-1 ...... A213819 . A213820 . A153978
3*h-1 ...... h .......... A213821 . A033431 . A176060
3*h-1 ...... 3*h-1 ...... A213822 . A213823 . A213824
3*h-1 ...... 3*h-2 ...... A213825 . A213826 . A213827
3*h-2 ...... 3*h-1 ...... A213828 . A213829 . A213830
2*h-1 ...... 3*h-2 ...... A213831 . A213832 . A212560
3*h-2 ...... 2*h-1 ...... A213833 . A130748 . A213834
h .......... 4*h-3 ...... A213835 . A172078 . A051797
4*h-3 ...... h .......... A213836 . A213837 . A071238
4*h-3 ...... 2*h-1 ...... A213838 . A213839 . A213840
2*h-1 ...... 4*h-3 ...... A213841 . A213842 . A213843
2*h-1 ...... 4*h-1 ...... A213844 . A213845 . A213846
4*h-1 ...... 2*h-1 ...... A213847 . A213848 . A180324
[(h+1)/2] .. [(h+1)/2] .. A213849 . A049778 . A213850
h .......... C(2*h-2,h-1) A213853
...
Suppose that u = (u(n)) and v = (v(n)) are sequences having generating functions U(x) and V(x), respectively. Then the convolution u**v has generating function U(x)*V(x). Accordingly, if u and v are homogeneous linear recurrence sequences, then every row of the convolution array T satisfies the same homogeneous linear recurrence equation, which can be easily obtained from the denominator of U(x)*V(x). Also, every column of T has the same homogeneous linear recurrence as v.

Examples

			Northwest corner (the array is read by southwest falling antidiagonals):
  1,  4, 10, 20,  35,  56,  84, ...
  2,  7, 16, 30,  50,  77, 112, ...
  3, 10, 22, 40,  65,  98, 140, ...
  4, 13, 28, 50,  80, 119, 168, ...
  5, 16, 34, 60,  95, 140, 196, ...
  6, 19, 40, 70, 110, 161, 224, ...
T(6,1) = (1)**(6) = 6;
T(6,2) = (1,2)**(6,7) = 1*7+2*6 = 19;
T(6,3) = (1,2,3)**(6,7,8) = 1*8+2*7+3*6 = 40.
		

Crossrefs

Cf. A000027.

Programs

  • Mathematica
    b[n_] := n; c[n_] := n
    t[n_, k_] := Sum[b[k - i] c[n + i], {i, 0, k - 1}]
    TableForm[Table[t[n, k], {n, 1, 10}, {k, 1, 10}]]
    Flatten[Table[t[n - k + 1, k], {n, 12}, {k, n, 1, -1}]]
    r[n_] := Table[t[n, k], {k, 1, 60}]  (* A213500 *)
  • PARI
    t(n,k) = sum(i=0, k - 1, (k - i) * (n + i));
    tabl(nn) = {for(n=1, nn, for(k=1, n, print1(t(k,n - k + 1),", ");); print(););};
    tabl(12) \\ Indranil Ghosh, Mar 26 2017
    
  • Python
    def t(n, k): return sum((k - i) * (n + i) for i in range(k))
    for n in range(1, 13):
        print([t(k, n - k + 1) for k in range(1, n + 1)]) # Indranil Ghosh, Mar 26 2017

Formula

T(n,k) = 4*T(n,k-1) - 6*T(n,k-2) + 4*T(n,k-3) - T(n,k-4).
T(n,k) = 2*T(n-1,k) - T(n-2,k).
G.f. for row n: x*(n - (n - 1)*x)/(1 - x)^4.

A005712 Coefficient of x^4 in expansion of (1+x+x^2)^n.

Original entry on oeis.org

1, 6, 19, 45, 90, 161, 266, 414, 615, 880, 1221, 1651, 2184, 2835, 3620, 4556, 5661, 6954, 8455, 10185, 12166, 14421, 16974, 19850, 23075, 26676, 30681, 35119, 40020, 45415, 51336, 57816, 64889, 72590, 80955, 90021, 99826, 110409, 121810, 134070
Offset: 2

Views

Author

Keywords

Comments

a(n) = A111808(n,4) for n>3. - Reinhard Zumkeller, Aug 17 2005
If a 2-set Y and 2-set Z, having one element in common, are subsets of an n-set X then a(n-3) is the number of 5-subsets of X intersecting both Y and Z. - Milan Janjic, Oct 03 2007
Antidiagonal sums of the convolution array A213781. - Clark Kimberling, Jun 22 2012

References

  • L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 78.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

a(n)= A027907(n, 4), n >= 2 (fifth column of trinomial coefficients).

Programs

  • Magma
    I:=[1, 6, 19, 45, 90]; [n le 5 select I[n] else 5*Self(n-1)-10*Self(n-2)+10*Self(n-3)-5*Self(n-4)+Self(n-5): n in [1..40]]; Vincenzo Librandi, Jun 16 2012
    
  • Maple
    seq(binomial(n+2,n-2) + binomial(n+1,n-2) - binomial(n,n-2), n=2..50); # Zerinvary Lajos, May 16 2006
    A005712:=(-1-z+z**2)/(z-1)**5; # Conjectured (correctly) by Simon Plouffe in his 1992 dissertation.
    A005712 := n -> GegenbauerC(`if`(4A005712(n)), n=2..20); # Peter Luschny, May 10 2016
  • Mathematica
    CoefficientList[Series[(1+x-x^2)/(1-x)^5,{x,0,40}],x] (* Vincenzo Librandi, Jun 16 2012 *)
    LinearRecurrence[{5,-10,10,-5,1},{1,6,19,45,90},40] (* Harvey P. Dale, Apr 30 2015 *)
  • PARI
    Vec((x^2)*(1+x-x^2)/(1-x)^5+O(x^99)) \\ Charles R Greathouse IV, Sep 23 2012

Formula

G.f.: (x^2)*(1+x-x^2)/(1-x)^5.
a(n) = binomial(n+2,n-2) + binomial(n+1,n-2) - binomial(n,n-2). - Zerinvary Lajos, May 16 2006
a(n) = 5*a(n-1) - 10*a(n-2) + 10*a(n-3) - 5*a(n-4) + a(n-5). Vincenzo Librandi, Jun 16 2012
a(n) = binomial(n,2) + 3*binomial(n,3) + binomial(n,4) (see our comment in A026729). - Vladimir Shevelev and Peter J. C. Moses, Jun 22 2012
a(n) = GegenbauerC(N, -n, -1/2) where N = 4 if 4Peter Luschny, May 10 2016
E.g.f.: exp(x)*x^2*(12 + 12*x + x^2)/24. - Stefano Spezia, Jul 09 2023

Extensions

More terms from Vladeta Jovovic, Oct 02 2000
Showing 1-3 of 3 results.