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!)
A025264 a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 4. 1

%I #13 Jun 15 2022 10:48:29

%S 2,1,1,5,22,99,450,2067,9586,44852,211570,1005427,4810460,23157904,

%T 112110906,545524287,2666864340,13092764136,64527778938,319157531592,

%U 1583724160896,7882364163954,39339994155288,196843821874407,987272738842392

%N a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 4.

%F G.f.: (1-sqrt(1-8*x+12*x^2+12*x^3))/2. - _Michael Somos_, Jun 08 2000

%F Recurrence: n*a(n) = 4*(2*n-3)*a(n-1) - 12*(n-3)*a(n-2) - 6*(2*n-9)*a(n-3). - _Vaclav Kotesovec_, Jan 25 2015

%t nmax = 30; aa = ConstantArray[0,nmax]; aa[[1]] = 2; aa[[2]] = 1; aa[[3]] = 1; Do[aa[[n]] = Sum[aa[[k]] * aa[[n-k]],{k,1,n-1}],{n,4,nmax}]; aa (* _Vaclav Kotesovec_, Jan 25 2015 *)

%o (PARI) a(n)=polcoeff((1-sqrt(1-8*x+12*x^2+12*x^3+x*O(x^n)))/2,n)

%Y Cf. A025266.

%K nonn

%O 1,1

%A _Clark Kimberling_

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.)