login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213770 Antidiagonal sums of the convolution array A213768. 3
1, 7, 23, 58, 126, 250, 467, 837, 1457, 2484, 4172, 6932, 11429, 18739, 30603, 49838, 81002, 131470, 213175, 345425, 559461, 905832, 1466328, 2373288, 3840841, 6215455, 10057727, 16274722, 26334102, 42610594, 68946587, 111559197 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..1000

Index entries for linear recurrences with constant coefficients, signature (4,-5,1,2,-1).

FORMULA

a(n) = 4*a(n-1) - 5*a(n-2) + a(n-3) + 2*a(n-4) - a(n-5).

G.f.: f(x)/g(x), where f(x) = x*(1 + 3*x) and g(x) = (1 - x - x^2)(1 - x)^3.

a(n) = 2*Fibonacci(n+6) + Lucas(n+4) - n*(2*n + 11) - 23. - Ehren Metcalfe, Jul 08 2019

MATHEMATICA

(See A213768.)

PROG

(MAGMA) [2*Fibonacci(n+6)+Lucas(n+4)-n*(2*n+11)-23: n in [1..35]]; // Vincenzo Librandi, Jul 09 2019

CROSSREFS

Cf. A213768, A213500.

Sequence in context: A151718 A027918 A058195 * A235683 A037165 A126284

Adjacent sequences:  A213767 A213768 A213769 * A213771 A213772 A213773

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, Jun 21 2012

STATUS

approved

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 December 12 07:31 EST 2019. Contains 329948 sequences. (Running on oeis4.)