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!)
A095799 Bell triangle A011971 squared. 1
1, 3, 4, 15, 21, 25, 107, 149, 200, 225, 1054, 1420, 1909, 2479, 2704, 13684, 17814, 23313, 30439, 38505, 41209, 224071, 283592, 360853, 461015, 587641, 727920, 769129, 4471699, 5535812, 6881856, 8590990, 10758160, 13443289, 16370471, 17139600 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Let M = the Bell triangle (A011971) as an infinite lower triangle matrix. Then T(n,k) = M^2[n,k].
EXAMPLE
T(3,2) = 21, because M = [1; 1 2; 2 3 5; ...], M^2 = [1; 3 4; 15 21 25; ...] and M^2[3,2] = 21.
Triangle begins:
: 1;
: 3, 4;
: 15, 21, 25;
: 107, 149, 200, 225;
: 1054, 1420, 1909, 2479, 2704;
: 13684, 17814, 23313, 30439, 38505, 41209;
MAPLE
with(combinat): A:= proc(n, k) option remember; `if`(k<=n, add(binomial(k, i) *bell(n-k+i), i=0..k), 0) end: M:= proc(n) option remember; Matrix(n, (i, j)-> A(i-1, j-1)) end: T:= (n, k)-> (M(n)^2)[n, k]: seq(seq(T(n, k), k=1..n), n=1..10); # Alois P. Heinz, Oct 12 2009
MATHEMATICA
max = 10; M = Table[If[k > n, 0, Sum[Binomial[k, i] BellB[n-k+i], {i, 0, k} ]], {n, 0, max-1}, {k, 0, max-1}];
T = M.M;
Table[T[[n]][[1 ;; n]], {n, 1, max}] // Flatten (* Jean-François Alcover, May 24 2016 *)
CROSSREFS
Cf. A011971. Diagonal gives A001247 for n>0.
Sequence in context: A136210 A041819 A369910 * A109926 A272514 A065942
KEYWORD
nonn,tabl
AUTHOR
Gary W. Adamson, Jun 06 2004
EXTENSIONS
Edited, corrected and extended by Alois P. Heinz, Oct 12 2009
STATUS
approved

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 March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)