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!)
A025093 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
3, 5, 22, 30, 66, 82, 161, 191, 342, 394, 680, 768, 1291, 1437, 2382, 2622, 4306, 4698, 7673, 8311, 13526, 14562, 23648, 25328, 41075, 43797, 70966, 75374, 122066, 129202, 209169, 220719, 357254, 375946, 608424, 638672, 1033531, 1082477, 1751630, 1830830 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..40.

FORMULA

Conjectures from Colin Barker, Aug 07 2019: (Start)

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).

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.

(End)

CROSSREFS

Sequence in context: A280037 A292557 A147442 * A025112 A203192 A025098

Adjacent sequences:  A025090 A025091 A025092 * A025094 A025095 A025096

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Missing a(10)=394 inserted by Sean A. Irvine, Aug 07 2019

STATUS

approved

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 June 25 03:00 EDT 2022. Contains 354835 sequences. (Running on oeis4.)