login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024467 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = A014306. 0

%I

%S 0,1,2,1,3,2,4,7,12,11,19,18,30,28,46,41,67,54,88,142,231,230,373,371,

%T 601,596,965,952,1541,1507,2439,2350,3803,3570,5776,5166,8359,6761,

%U 10940,17702,28643,28635,46333,46312,74935,74880,121159,121015,195807,195430,316213

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

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 03:11 EDT 2021. Contains 347651 sequences. (Running on oeis4.)