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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024592 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers). 0

%I

%S 1,3,11,17,38,50,97,119,213,251,432,496,833,939,1555,1729,2838,3122,

%T 5097,5559,9045,9795,15904,17120,27761,29731,48171,51361,83174,88338,

%U 143009,151367,244997,258523,418384,440272,712465,747883,1210195,1267505

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = (odd natural numbers).

%F G.f.:(1-3*x^7+x^6-6*x^5+2*x^4-4*x^3+4*x^2+x)/((x-1)^2*(x^4+x^2-1)^2) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]

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

Last modified November 28 00:12 EST 2021. Contains 349395 sequences. (Running on oeis4.)