Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)

Revision History for A330460

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A330460 Triangle read by rows where T(n,k) is the number of set partitions with k blocks and total sum n.
(history; published version)
#18 by Susanna Cuyler at Sun May 16 12:24:54 EDT 2021
STATUS

proposed

approved

#17 by Jean-François Alcover at Sun May 16 12:17:15 EDT 2021
STATUS

editing

proposed

#16 by Jean-François Alcover at Sun May 16 12:17:09 EDT 2021
MATHEMATICA

(* Second program; *): *)

#15 by Jean-François Alcover at Sun May 16 12:16:41 EDT 2021
MATHEMATICA

(* Second program; *)

b[n_, i_, k_] := b[n, i, k] = If[i(i+1)/2 < n, 0, If[n == 0, x^k, b[n, i-1, k] + Function[t, k*b[n-i, t, k] + b[n-i, t, k + 1]][Min[n-i, i-1]]]];

T[n_] := PadRight[CoefficientList[b[n, n, 0], x], n + 1];

T /@ Range[0, 15] // Flatten (* Jean-François Alcover, May 16 2021, after Alois P. Heinz *)

STATUS

approved

editing

#14 by Alois P. Heinz at Sun Dec 29 19:19:31 EST 2019
STATUS

editing

approved

#13 by Alois P. Heinz at Sun Dec 29 19:19:21 EST 2019
CROSSREFS

Cf. A000110, A008277, A050342, A060016, A072706, A270995, A271619, A279375, A279785, A326701, A330459, A330462, A330463, A330759.

#12 by Alois P. Heinz at Sun Dec 29 15:02:04 EST 2019
MAPLE

b:= proc(n, i, k) option remember; `if`(i*(i+1)/2<n, 0,

`if`(n=0, x^k, b(n, i-1, k) +(t-> k*

b(n-i, t, k)+b(n-i, t, k+1))(min(n-i, i-1))))

end:

T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n$2, 0)):

seq(T(n), n=0..15); # Alois P. Heinz, Dec 29 2019

#11 by Alois P. Heinz at Sun Dec 29 15:01:10 EST 2019
DATA

1, 0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 3, 2, 0, 0, 0, 0, 4, 5, 1, 0, 0, 0, 0, 5, 6, 1, 0, 0, 0, 0, 0, 6, 9, 2, 0, 0, 0, 0, 0, 0, 8, 13, 3, 0, 0, 0, 0, 0, 0, 0, 10, 23, 10, 1, 0, 0, 0, 0, 0, 0, 0, 12, 27, 11, 1, 0, 0, 0, 0, 0, 0, 0, 0, 15, 40, 19, 2, 0, 0, 0, 0, 0, 0, 0, 0

STATUS

proposed

editing

#10 by Andrew Howroyd at Sun Dec 29 12:56:08 EST 2019
STATUS

editing

proposed

#9 by Andrew Howroyd at Sun Dec 29 12:50:19 EST 2019
LINKS

Andrew Howroyd, <a href="/A330460/b330460.txt">Table of n, a(n) for n = 0..1325</a> (rows n=0..50)

PROG

(PARI)

A(n)={my(v=Vec(prod(k=1, n, 1 + x^k*y + O(x*x^n)))); vector(#v, n, my(p=v[n]); vector(n, k, sum(i=k, n, polcoef(p, i-1)*stirling(i-1, k-1, 2))))}

{my(T=A(12)); for(n=1, #T, print(T[n]))} \\ Andrew Howroyd, Dec 29 2019

STATUS

approved

editing

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 13:06 EDT 2024. Contains 375269 sequences. (Running on oeis4.)