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!)
A025078 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers). 0

%I #5 Mar 31 2012 10:30:15

%S 1,2,5,8,19,31,65,105,210,340,654,1058,1985,3212,5911,9564,17345,

%T 28065,50305,81395,144516,233832,411900,666468,1166209,1886966,

%U 3283145,5312240,9197455,14881795,25655489,41511453,71293590,115355452

%N a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (Fibonacci numbers).

%K nonn

%O 1,2

%A _Clark Kimberling_

%E More terms from _James A. Sellers_, May 03 2000

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 August 11 22:58 EDT 2024. Contains 375078 sequences. (Running on oeis4.)