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

%I #5 Feb 25 2015 14:57:21

%S 1,3,1,1,4,8,22,55,145,386,1039,2837,7808,21693,60697,170959,484306,

%T 1379020,3944780,11330962,32668988,94510169,274262571,798153211,

%U 2328830794,6811354123,19966156857,58647721275,172600025350,508870577560,1502795261440

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

%F Conjecture: n*a(n) +(-2*n+3)*a(n-1) +5*(-n+3)*a(n-2) +(2*n-9)*a(n-3) +9*(n-6)*a(n-4)=0. - _R. J. Mathar_, Feb 25 2015

%K nonn

%O 1,2

%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 March 29 01:34 EDT 2024. Contains 371264 sequences. (Running on oeis4.)