login
a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (odd natural numbers).
0

%I #10 Aug 07 2019 06:52:57

%S 3,5,22,30,66,82,161,191,342,394,680,768,1291,1437,2382,2622,4306,

%T 4698,7673,8311,13526,14562,23648,25328,41075,43797,70966,75374,

%U 122066,129202,209169,220719,357254,375946,608424,638672,1033531,1082477,1751630,1830830

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

%F Conjectures from _Colin Barker_, Aug 07 2019: (Start)

%F G.f.: x*(3 - x + 9*x^2 - 7*x^3 - 5*x^4 - x^5 - 2*x^6 - 2*x^7) / ((1 - x)^2*(1 - x^2 - x^4)^2).

%F a(n) = 2*a(n-1) + a(n-2) - 4*a(n-3) + 3*a(n-4) - 2*a(n-5) - a(n-6) + 4*a(n-7) - 3*a(n-8) + 2*a(n-9) - a(n-10) for n>10.

%F (End)

%K nonn

%O 1,1

%A _Clark Kimberling_

%E Missing a(10)=394 inserted by _Sean A. Irvine_, Aug 07 2019