The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A365907 Smallest nonnegative integer that is not the sum of fewer than n signed Lucas numbers. 2
 0, 1, 5, 16, 63, 262, 1105, 4676, 19803, 83882, 355325, 1505176, 6376023, 27009262, 114413065, 484661516, 2053059123, 8696898002, 36840651125, 156059502496, 661078661103, 2800374146902, 11862575248705, 50250675141716, 212865275815563, 901711778403962 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Signed Lucas numbers are the union of A000032 and A061084. LINKS Table of n, a(n) for n=0..25. Index entries for linear recurrences with constant coefficients, signature (5,-3,-1). FORMULA a(n) = n, for n<2. a(n) = (A000032(3*n-2)+3)/2 = 1+4+Sum_{i=2..n-1} A000032(3*n-1), for n>1. G.f.: x*(1 - 6*x^2 - x^3)/((1 - x)*(1 - 4*x - x^2)). - Stefano Spezia, Sep 25 2023 EXAMPLE a(0) = 0, the sum of 0 Lucas numbers. a(1) = 1 = A000032(1), the sum of 1 Lucas number. a(2) = 5 = 1+4 = A000032(1)+A000032(3), the sum of 2 Lucas numbers. (2, 3, and 4 need only one term, since they are Lucas numbers.) a(4) = 63 = 1+4+11+47. For comparison, 45 is the first sum requiring 4 positive Lucas numbers (45 = 1+4+11+29, see A004146), but here 45 = 47+2-4 requires only 3 signed Lucas numbers so that a(4) != 45. MATHEMATICA LinearRecurrence[{5, -3, -1}, {0, 1, 5, 16, 63}, 26] (* Amiram Eldar, Sep 26 2023 *) PROG (Python) from sympy import lucas a = lambda n: n if n<2 else (lucas(3*n-2)+3)//2 CROSSREFS Cf. A000032, A061084, A004146 (analogous with only positive Lucas numbers). Sequence in context: A300317 A307469 A197549 * A034532 A092497 A275100 Adjacent sequences: A365904 A365905 A365906 * A365908 A365909 A365910 KEYWORD nonn,easy AUTHOR Mike Speciner, Sep 22 2023 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.

Last modified August 11 03:32 EDT 2024. Contains 375059 sequences. (Running on oeis4.)