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

%I #10 Jun 15 2022 10:25:35

%S 0,1,2,0,2,4,2,12,18,24,82,120,242,620,1010,2324,5154,9520,22178,

%T 46512,94178,214548,446690,952732,2122034,4475592,9776626,21491496,

%U 46096338,101585276,222360530,483573796,1068438594,2341596256,5140674882,11369018464

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

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

%F Conjecture: n*(n^2+n+1)*a(n) +(n-1)*(n^2+2*n+3)*a(n-1) -2*(n-3)*(n^2+n+1)*a(n-2) +2*(-5*n^3+16*n^2+19*n+30)*a(n-3) +(-7*n^3+23*n^2+59*n+126)*a(n-4) +(n-7)*(n^2+2*n+3)*a(n-5)=0. - _R. J. Mathar_, Feb 25 2015

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

%K nonn

%O 1,3

%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 13:51 EDT 2024. Contains 371914 sequences. (Running on oeis4.)