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!)
A264151 Row sums of A179455. 2

%I #23 May 25 2020 11:51:07

%S 1,1,3,12,63,398,2911,24177,224824,2313892,26107679,320412404,

%T 4249353369,60561549764,923107802463,14985538729504,258138422935578,

%U 4702896016961154,90350619640638353,1825564783445799571,38700814850328413380,858915876402686598209,19916917035087719607321

%N Row sums of A179455.

%H Vaclav Kotesovec, <a href="/A264151/b264151.txt">Table of n, a(n) for n = 0..447</a>

%H Swapnil Garg, Alan Peng, <a href="https://arxiv.org/abs/2005.08889">Classical and consecutive pattern avoidance in rooted forests</a>, arXiv:2005.08889 [math.CO], May 2020.

%H Peter Luschny, <a href="http://www.oeis.org/wiki/User:Peter_Luschny/PermutationTrees">Permutation Trees</a>

%F 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.

%e a(4) = 5*0 + 4*1 + 3*14 + 2*8 + 1*1 = 63.

%o (Sage) # uses[bell_transform from A264428]

%o def A264151_list(len):

%o b = [1]+[0]*(len-1); L = [b]

%o for k in range(len):

%o b = [sum((bell_transform(n, b))) for n in range(len)]

%o L.append(b)

%o return [sum(L[k][n] for k in (0..n)) for n in range(len)]

%o print(A264151_list(10))

%Y Cf. A179454, A179455, A264428.

%K nonn

%O 0,3

%A _Peter Luschny_, Dec 06 2015

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 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)