The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A264151 Row sums of A179455. 2
 1, 1, 3, 12, 63, 398, 2911, 24177, 224824, 2313892, 26107679, 320412404, 4249353369, 60561549764, 923107802463, 14985538729504, 258138422935578, 4702896016961154, 90350619640638353, 1825564783445799571, 38700814850328413380, 858915876402686598209, 19916917035087719607321 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Vaclav Kotesovec, Table of n, a(n) for n = 0..447 Swapnil Garg, Alan Peng, Classical and consecutive pattern avoidance in rooted forests, arXiv:2005.08889 [math.CO], May 2020. Peter Luschny, Permutation Trees FORMULA a(n) = Sum_{k=0..n} (n-k+1)*A179454(n,k), where A179454(n,k) is read as a (0,0)-based table with an additional column (1,0,0,0,...) at the left hand side. EXAMPLE a(4) = 5*0 + 4*1 + 3*14 + 2*8 + 1*1 = 63. PROG (Sage) # uses[bell_transform from A264428] def A264151_list(len):     b = [1]+[0]*(len-1); L = [b]     for k in range(len):         b = [sum((bell_transform(n, b))) for n in range(len)]         L.append(b)     return [sum(L[k][n] for k in (0..n)) for n in range(len)] print(A264151_list(10)) CROSSREFS Cf. A179454, A179455, A264428. Sequence in context: A020123 A307708 A308206 * A186186 A238887 A135889 Adjacent sequences:  A264148 A264149 A264150 * A264152 A264153 A264154 KEYWORD nonn AUTHOR Peter Luschny, Dec 06 2015 STATUS approved

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

Last modified January 18 15:35 EST 2021. Contains 340254 sequences. (Running on oeis4.)