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!)
A216733 a(1)=1; thereafter a(n) = (n/2)*Sum_{i=1..n-1} K(i,n-i)*a(i)*a(n-i), where K(i,j)=i/j+j/i+2. 0
1, 4, 54, 1280, 44500, 2095632, 127881376, 9819500544, 928097190000, 106056995000000, 14432021983025504, 2308065337772034048, 428863163196474895616, 91656939861553564825600, 22332165732277725605760000, 6154560612828089005182025728, 1905106896258617768240402396928, 658221263587332244069472967367680, 252407458471654722567803941053452800 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
P. L. Krapivsky and Colm Connaughton, Driven Brownian coagulation of polymers, arXiv preprint arXiv:1203.3905, 2012
MAPLE
K:=(i, j)->i/j+j/i+2;
B:=proc(n) option remember; global K;
if n=1 then 1 else
(n/2)*add( K(i, n-i)*B(i)*B(n-i), i=1..n-1); fi; end;
MATHEMATICA
K[i_, j_] := i/j + j/i + 2;
a[1] = 1; a[n_] := a[n] = (n/2) Sum[K[i, n-i] a[i] a[n-i], {i, 1, n-1}];
Array[a, 19] (* Jean-François Alcover, Dec 06 2017 *)
CROSSREFS
Sequence in context: A259063 A138459 A111161 * A203039 A369569 A201731
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 17 2012
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 April 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)