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!)
A246715 n * Lucas(n) - (n - 1) * Lucas(n - 1). 1
1, 5, 6, 16, 27, 53, 95, 173, 308, 546, 959, 1675, 2909, 5029, 8658, 14852, 25395, 43297, 73627, 124909, 211456, 357270, 602551, 1014551, 1705657, 2863493, 4800990, 8039608, 13447563, 22469261, 37505879, 62546285, 104212364, 173489994, 288593903, 479706787, 796815125, 1322659237, 2194126122, 3637574444, 6027141411, 9980945785 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
By definition, the arithmetic mean of a(1), ... a(n) is equal to L(n) and a(n) - Lucas(n) = (n - 1) * Lucas(n - 2). See A136391 for the Fibonacci case.
LINKS
FORMULA
Recurrence: a(n + 1) = a(n) + a(n - 1) + 5*F(n - 2), n >= 2, where F = A000045. Proof: similar to A136391.
Also, a(n) = 2*a(n - 1) + a(n - 2) - 2*a(n - 3) - a(n - 4).
G.f.: x*(1 - x)*(1 + 4*x - x^2)/(1 - x - x^2)^2.
EXAMPLE
a(6) = 53 = 6*Lucas(6) - 5*Lucas(5) = 6 * 18 - 5 * 11 = 108 - 55.
a(4) = 16 = 4*Lucas(2) + Lucas(3) = 3*Lucas(2) + Lucas(4).
MAPLE
with(combinat): seq(n*(fibonacci(n-1)+fibonacci(n-3)) +fibonacci(n)+fibonacci(n-2), n=1..40).
MATHEMATICA
Table[LucasL[n]n - LucasL[n - 1](n - 1), {n, 35}] (* Alonso del Arte, Sep 02 2014 *)
PROG
(PARI) a(n) = n*(fibonacci(n-1)+fibonacci(n-3)) +fibonacci(n)+fibonacci(n-2); \\ Michel Marcus, Sep 02 2014
CROSSREFS
Sequence in context: A068408 A186696 A034454 * A185508 A358091 A257338
KEYWORD
nonn,easy
AUTHOR
Giuseppe Coppoletta, Sep 02 2014
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 April 23 16:40 EDT 2024. Contains 371916 sequences. (Running on oeis4.)