A001595 -id:A001595 - cp's OEIS frontend

A376081 Irregular triangle read by rows: row n is the periodic part of the Leonardo numbers (A001595) modulo n.

0, 1, 1, 1, 0, 2, 0, 0, 1, 2, 1, 1, 3, 1, 1, 3, 0, 4, 0, 0, 1, 2, 4, 2, 2, 0, 3, 4, 3, 3, 2, 1, 4, 1, 1, 3, 5, 3, 3, 1, 5, 1, 1, 3, 5, 2, 1, 4, 6, 4, 4, 2, 0, 3, 4, 1, 6, 1, 1, 3, 5, 1, 7, 1, 1, 3, 5, 0, 6, 7, 5, 4, 1, 6, 8, 6, 6, 4, 2, 7, 1, 0, 2, 3, 6, 1, 8

Offset: 1

Paolo Xausa, Sep 09 2024

Each row n >= 3 ends in (1, n-1) (see Wikipedia article).

			Triangle begins:
  [1]  0;
  [2]  1;
  [3]  1, 1, 0, 2, 0, 0, 1, 2;
  [4]  1, 1, 3;
  [5]  1, 1, 3, 0, 4, 0, 0, 1, 2, 4, 2, 2, 0, 3, 4, 3, 3, 2, 1, 4;
  [6]  1, 1, 3, 5, 3, 3, 1, 5;
  [7]  1, 1, 3, 5, 2, 1, 4, 6, 4, 4, 2, 0, 3, 4, 1, 6;
  [8]  1, 1, 3, 5, 1, 7;
  [9]  1, 1, 3, 5, 0, 6, 7, 5, 4, 1, 6, 8, 6, 6, 4, 2, 7, 1, 0, 2, 3, 6, 1, 8;
  ...
For n = 8:
A001595       = 1, 1, 3, 5, 9, 15, 25, 41, 67, 109, 177, 287, 465, ...
A001595 mod 8 = 1, 1, 3, 5, 1,  7,  1,  1,  3,   5,   1,   7,   1, ...
                \_______________/
                  periodic part

Paolo Xausa, Table of n, a(n) for n = 1..12347 (rows 1..150 of triangle, flattened).
Wikipedia, Leonardo number.

Cf. A001595, A161553, A376082 (row lengths), A376083 (row sums).

A376081row[n_] := If[n < 3, {n - 1}, Module[{k = 1}, NestWhileList[Mod[2 * Fibonacci[++k] - 1, n] &, 1, {#, #2} != {1, n-1} &, {3, 2}]]];
Array[A376081row, 10]

T(n,k) = A001595(k) mod n, with 0 <= k < A376082(n).

A376082 a(n) is the period of the Leonardo numbers (A001595) modulo n.

Original entry on oeis.org

1, 1, 8, 3, 20, 8, 16, 6, 24, 20, 10, 24, 28, 16, 40, 12, 36, 24, 18, 60, 16, 10, 48, 24, 100, 28, 72, 48, 14, 40, 30, 24, 40, 36, 80, 24, 76, 18, 56, 60, 40, 16, 88, 30, 120, 48, 32, 24, 112, 100, 72, 84, 108, 72, 20, 48, 72, 14, 58, 120, 60, 30, 48, 48, 140

Offset: 1

Paolo Xausa, Sep 10 2024

nonn

See A376081 for more information.

Paolo Xausa, Table of n, a(n) for n = 1..10000

Row lengths of A376081.

Cf. A001175.

A376082[n_] := If[n < 3, 1, Module[{k = 1}, NestWhile[Mod[2*Fibonacci[++k] - 1, n] &, 1, {#, #2} != {1, n-1} &, {3, 2}]; k]];
Array[A376082, 100]

Apparently, a(2*k) = A001175(k), for k >= 1.

A117502 Triangle, row sums = A001595.

Original entry on oeis.org

1, 1, 2, 1, 1, 3, 1, 1, 2, 5, 1, 1, 2, 3, 8, 1, 1, 2, 3, 5, 13, 1, 1, 2, 3, 5, 8, 21, 1, 1, 2, 3, 5, 8, 13, 34, 1, 1, 2, 3, 5, 8, 13, 21, 55, 1, 1, 2, 3, 5, 8, 13, 21, 34, 89, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 144, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 233

Offset: 1

Gary W. Adamson, Mar 23 2006

Row sums = A001595 = (1, 3, 9, 15, 25, 41, ...).

			Row 5 of the triangle = (1, 1, 2, 3, 8); the first 5 Fibonacci terms with a deletion of F(5) = 5.
First few rows of the triangle are:
  1;
  1, 2;
  1, 1, 3;
  1, 1, 2, 5;
  1, 1, 2, 3, 8; ...

G. C. Greubel, Rows n = 1..100 of triangle, flattened

Cf. A000045, A117501, A001595.

T:= function(n,k)
    if k=n then return Fibonacci(n+1);
    else return Fibonacci(k);
    fi;
  end;
Flat(List([1..20], n-> List([1..n], k-> T(n,k) ))); # G. C. Greubel, Jul 14 2019

[k eq n select Fibonacci(n+1) else Fibonacci(k): k in [1..n], n in [1..20]]; // G. C. Greubel, Jul 10 2019

Table[If[k==n, Fibonacci[n+1], Fibonacci[k]], {n, 20}, {k, n}]//Flatten (* G. C. Greubel, Jul 10 2019 *)

T(n,k) = if(k==n, fibonacci(n+1), fibonacci(k)); \\ G. C. Greubel, Jul 10 2019

def T(n, k):
    if (k==n): return fibonacci(n+1)
    else: return fibonacci(k)
[[T(n, k) for k in (1..n)] for n in (1..20)] # G. C. Greubel, Jul 10 2019

n-th row = first n Fibonacci terms, with a deletion of F(n).
Columns of the triangle are difference terms of the array in A117501.
T(n,k) = Fibonacci(k) for k < n and T(n,n) = Fibonacci(n+1). - G. C. Greubel, Jul 10 2019

More terms added by G. C. Greubel, Jul 10 2019

A375500 a(n) = Sum_{k=0..n} A001595(k)^2.

Original entry on oeis.org

1, 2, 11, 36, 117, 342, 967, 2648, 7137, 19018, 50347, 132716, 348941, 915950, 2401911, 6294640, 16489889, 43187778, 113094099, 296127940, 775343821, 2029991062, 5314771031, 13914551256, 36429253657, 95373809882, 249693147107, 653707202748, 1711431003597, 4480589921838

Offset: 0

Stefano Spezia, Aug 18 2024

Sergio Falcon, Sum of the Squares of the Extended (k, t)-Fibonacci Numbers, Preprints 2024, 2024081150. See p. 4.
Index entries for linear recurrences with constant coefficients, signature (5,-6,-4,10,-2,-3,1).

Cf. A000045, A001595, A375501.

a[n_]:=4*(Fibonacci[n+1] - 1)*(Fibonacci[n+2] - 1) + n + 1; Array[a,30,0]

a(n) = 4*(Fibonacci(n+1) - 1)*(Fibonacci(n+2) - 1) + n + 1 (see Falcon).
G.f.: (1 - 3*x + 7*x^2 - 3*x^3 + x^4 - x^5)/((1 - x)^2*(1 + x)*(1 - 3*x + x^2)*(1 - x - x^2)).
E.g.f.: (4*exp(-x) + exp(x)*(5 + x) + 8*exp(x/2)*((2*exp(x) - 5)*cosh(sqrt(5)*x/2) + sqrt(5)*(exp(x) - 2)*sinh(sqrt(5)*x/2)))/5.

A375501 a(n) = Sum_{k=0..n} (-1)^k*A001595(k)^2.

Original entry on oeis.org

1, 0, 9, -16, 65, -160, 465, -1216, 3273, -8608, 22721, -59648, 156577, -410432, 1075529, -2817200, 7378049, -19319840, 50586481, -132447360, 346768521, -907878720, 2376901249, -6222878976, 16291823425, -42652732800, 111666604425, -292347451216, 765376349633, -2003782568608

Offset: 0

Stefano Spezia, Aug 18 2024

Sergio Falcon, Sum of the Squares of the Extended (k, t)-Fibonacci Numbers, Preprints 2024, 2024081150. See p. 7.
Index entries for linear recurrences with constant coefficients, signature (-3,2,8,-2,-6,1,1).

Cf. A000045, A001595, A059841, A375500.

a[n_]:=4*(-1)^n*(2*Fibonacci[2*n]/5+Fibonacci[n]^2-Fibonacci[n])+8*n/5+(1+(-1)^n)/2; Array[a,30,0]

a(n) = 4*(-1)^n*(2*Fibonacci(2*n)/5 + Fibonacci(n)^2 - Fibonacci(n)) + 8*n/5 + A059841(n) (see Falcon).

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

A101220 a(n) = Sum_{k=0..n} Fibonacci(n-k)*n^k.

Original entry on oeis.org

0, 1, 3, 14, 91, 820, 9650, 140601, 2440317, 49109632, 1123595495, 28792920872, 816742025772, 25402428294801, 859492240650847, 31427791175659690, 1234928473553777403, 51893300561135516404, 2322083099525697299278

Offset: 0

Ross La Haye, Dec 14 2004

In what follows a(i,j,k) denotes a three-dimensional array, the terms a(n) are defined as a(n,n,n) in that array. - Joerg Arndt, Jan 03 2021
Previous name was: Three-dimensional array: a(i,j,k) = expansion of x*(1 + (i-j)*x)/((1-j*x)*(1-x-x^2)), read by a(n,n,n).
a(i,j,k) = the k-th value of the convolution of the Fibonacci numbers (A000045) with the powers of i = Sum_{m=0..k} a(i-1,j,m), both for i = j and i > 0; a(i,j,k) = a(i-1,j,k) + a(j,j,k-1), for i,k > 0; a(i,1,k) = Sum_{m=0..k} a(i-1,0,m), for i > 0. With F = Fibonacci and L = Lucas, then a(1,1,k) = F(k+2) - 1; a(2,1,k) = F(k+3) - 2; a(3,1,k) = L(k+2) - 3; a(4,1,k) = 4*F(k+1) + F(k) - 4; a(1,2,k) = 2^k - F(k+1); a(2,2,k) = 2^(k+1) - F(k+3); a(3,2,k) = 3(2^k - F(k+2)) + F(k); a(4,2,k) = 2^(k+2) - F(k+4) - F(k+2); a(1,3,k) = (3^k + L(k-1))/5, for k > 0; a(2,3,k) = (2 * 3^k - L(k)) /5, for k > 0; a(3,3,k) = (3^(k+1) - L(k+2))/5; a(4,3,k) = (4 * 3^k - L(k+2) - L(k+1))/5, etc..

			a(1,3,3) = 6 because a(1,3,0) = 0, a(1,3,1) = 1, a(1,3,2) = 2 and 4*2 - 2*1 - 3*0 = 6.

G. C. Greubel, Table of n, a(n) for n = 0..385
Eric Weisstein's World of Mathematics, Fibonacci Number
Eric Weisstein's World of Mathematics, Lucas Number

a(0, j, k) = A000045(k).
a(1, 2, k+1) - a(1, 2, k) = A099036(k).
a(3, 2, k+1) - a(3, 2, k) = A104004(k).
a(4, 2, k+1) - a(4, 2, k) = A027973(k).
a(1, 3, k+1) - a(1, 3, k) = A099159(k).
a(i, 0, k) = A109754(i, k).
a(i, i+1, 3) = A002522(i+1).
a(i, i+1, 4) = A071568(i+1).
a(2^i-2, 0, k+1) = A118654(i, k), for i > 0.
Sequences of the form a(n, 0, k): A000045(k+1) (n=1), A000032(k) (n=2), A000285(k-1) (n=3), A022095(k-1) (n=4), A022096(k-1) (n=5), A022097(k-1) (n=6), A022098(k-1) (n=7), A022099(k-1) (n=8), A022100(k-1) (n=9), A022101(k-1) (n=10), A022102(k-1) (n=11), A022103(k-1) (n=12), A022104(k-1) (n=13), A022105(k-1) (n=14), A022106(k-1) (n=15), A022107(k-1) (n=16), A022108(k-1) (n=17), A022109(k-1) (n=18), A022110(k-1) (n=19), A088209(k-2) (n=k-2), A007502(k) (n=k-1), A094588(k) (n=k).
Sequences of the form a(1, n, k): A000071(k+2) (n=1), A027934(k-1) (n=2), A098703(k) (n=3).
Sequences of the form a(2, n, k): A001911(k) (n=1), A008466(k+1) (n=2), A106517(k-1) (n=3).
Sequences of the form a(3, n, k): A027961(k) (n=1), A094688(k) (n=3).
Sequences of the form a(4, n, k): A053311(k-1) (n=1), A027974(k-1) (n=2).
Cf. A001622, A001891, A001924, A023537, A104161, A106517.

A101220:= func< n | (&+[n^k*Fibonacci(n-k): k in [0..n]]) >;
[A101220(n): n in [0..30]]; // G. C. Greubel, Jun 01 2025

Join[{0}, Table[Sum[Fibonacci[n-k]*n^k, {k, 0, n}], {n, 1, 20}]] (* Vaclav Kotesovec, Jan 03 2021 *)

a(n)=sum(k=0,n,fibonacci(n-k)*n^k) \\ Joerg Arndt, Jan 03 2021

def A101220(n): return sum(n^k*fibonacci(n-k) for k in range(n+1))
print([A101220(n) for n in range(31)]) # G. C. Greubel, Jun 01 2025

a(i, j, 0) = 0, a(i, j, 1) = 1, a(i, j, 2) = i+1; a(i, j, k) = ((j+1)*a(i, j, k-1)) - ((j-1)*a(i, j, k-2)) - (j*a(i, j, k-3)), for k > 2.
a(i, j, k) = Fibonacci(k) + i*a(j, j, k-1), for i, k > 0.
a(i, j, k) = (Phi^k - (-Phi)^-k + i(((j^k - Phi^k) / (j - Phi)) - ((j^k - (-Phi)^-k) / (j - (-Phi)^-1)))) / sqrt(5), where Phi denotes the golden mean/ratio (A001622).
i^k = a(i-1, i, k) + a(i-2, i, k+1).
A104161(k) = Sum_{m=0..k} a(k-m, 0, m).
a(i, j, 0) = 0, a(i, j, 1) = 1, a(i, j, 2) = i+1, a(i, j, 3) = i*(j+1) + 2; a(i, j, k) = (j+2)*a(i, j, k-1) - 2*j*a(i, j, k-2) - a(i, j, k-3) + j*a(i, j, k-4), for k > 3. a(i, j, 0) = 0, a(i, j, 1) = 1; a(i, j, k) = a(i, j, k-1) + a(i, j, k-2) + i * j^(k-2), for k > 1.
G.f.: x*(1 + (i-j)*x)/((1-j*x)*(1-x-x^2)).
a(n, n, n) = Sum_{k=0..n} Fibonacci(n-k) * n^k. - Ross La Haye, Jan 14 2006
Sum_{m=0..k} binomial(k,m)*(i-1)^m = a(i-1,i,k) + a(i-2,i,k+1), for i > 1. - Ross La Haye, May 29 2006
From Ross La Haye, Jun 03 2006: (Start)
a(3, 3, k+1) - a(3, 3, k) = A106517(k).
a(1, 1, k) = A001924(k) - A001924(k-1), for k > 0.
a(2, 1, k) = A001891(k) - A001891(k-1), for k > 0.
a(3, 1, k) = A023537(k) - A023537(k-1), for k > 0.
Sum_{j=0..i+1} a(i-j+1, 0, j) - Sum_{j=0..i} a(i-j, 0, j) = A001595(i). (End)
a(i,j,k) = a(j,j,k) + (i-j)*a(j,j,k-1), for k > 0.
a(n) ~ n^(n-1). - Vaclav Kotesovec, Jan 03 2021

New name from Joerg Arndt, Jan 03 2021

A192951 Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.

Original entry on oeis.org

0, 1, 3, 9, 20, 40, 74, 131, 225, 379, 630, 1038, 1700, 2773, 4511, 7325, 11880, 19252, 31182, 50487, 81725, 132271, 214058, 346394, 560520, 906985, 1467579, 2374641, 3842300, 6217024, 10059410, 16276523, 26336025, 42612643, 68948766

Offset: 0

Clark Kimberling, Jul 13 2011

The titular polynomials are defined recursively:  p(n,x) = x*p(n-1,x) + 3n - 1, with p(0,x)=1.  For an introduction to reductions of polynomials by substitutions such as x^2 -> x+1, see A192232 and A192744.
...
The list of examples at A192744 is extended here; the recurrence is given by p(n,x) = x*p(n-1,x) + v(n), with p(0,x)=1, and the reduction of p(n,x) by x^2 -> x+1 is represented by u1 + u2*x:
...
If v(n)=        n, then u1=A001595, u2=A104161.
If v(n)=      n-1, then u1=A001610, u2=A066982.
If v(n)=     3n-1, then u1=A171516, u2=A192951.
If v(n)=     3n-2, then u1=A192746, u2=A192952.
If v(n)=     2n-1, then u1=A111314, u2=A192953.
If v(n)=      n^2, then u1=A192954, u2=A192955.
If v(n)=   -1+n^2, then u1=A192956, u2=A192957.
If v(n)=    1+n^2, then u1=A192953, u2=A192389.
If v(n)=   -2+n^2, then u1=A192958, u2=A192959.
If v(n)=    2+n^2, then u1=A192960, u2=A192961.
If v(n)=    n+n^2, then u1=A192962, u2=A192963.
If v(n)=   -n+n^2, then u1=A192964, u2=A192965.
If v(n)= n(n+1)/2, then u1=A030119, u2=A192966.
If v(n)= n(n-1)/2, then u1=A192967, u2=A192968.
If v(n)= n(n+3)/2, then u1=A192969, u2=A192970.
If v(n)=     2n^2, then u1=A192971, u2=A192972.
If v(n)=   1+2n^2, then u1=A192973, u2=A192974.
If v(n)=  -1+2n^2, then u1=A192975, u2=A192976.
If v(n)=  1+n+n^2, then u1=A027181, u2=A192978.
If v(n)=  1-n+n^2, then u1=A192979, u2=A192980.
If v(n)=  (n+1)^2, then u1=A001891, u2=A053808.
If v(n)=  (n-1)^2, then u1=A192981, u2=A192982.

Vincenzo Librandi, Table of n, a(n) for n = 0..400
Index entries for linear recurrences with constant coefficients, signature (3, -2, -1, 1).

Cf. A000045, A192232, A192744.

F:=Fibonacci;; List([0..40], n-> F(n+4)+2*F(n+2)-(3*n+5)); # G. C. Greubel, Jul 12 2019

I:=[0, 1, 3, 9]; [n le 4 select I[n] else 3*Self(n-1)-2*Self(n-2)-1*Self(n-3)+Self(n-4): n in [1..40]]; // Vincenzo Librandi, Nov 16 2011

F:=Fibonacci; [F(n+4)+2*F(n+2)-(3*n+5): n in [0..40]]; // G. C. Greubel, Jul 12 2019

(* First program *)
q = x^2; s = x + 1; z = 40;
p[0, x]:= 1;
p[n_, x_]:= x*p[n-1, x] + 3n - 1;
Table[Expand[p[n, x]], {n, 0, 7}]
reduce[{p1_, q_, s_, x_}]:= FixedPoint[(s PolynomialQuotient @@ #1 + PolynomialRemainder @@ #1 &)[{#1, q, x}] &, p1]
t = Table[reduce[{p[n, x], q, s, x}], {n, 0, z}];
u1 = Table[Coefficient[Part[t, n], x, 0], {n, 1, z}] (* A171516 *)
u2 = Table[Coefficient[Part[t, n], x, 1], {n, 1, z}] (* A192951 *)
(* Additional programs *)
LinearRecurrence[{3,-2,-1,1},{0,1,3,9},40] (* Vincenzo Librandi, Nov 16 2011 *)
With[{F=Fibonacci}, Table[F[n+4]+2*F[n+2]-(3*n+5), {n,0,40}]] (* G. C. Greubel, Jul 12 2019 *)

a(n)=([0,1,0,0; 0,0,1,0; 0,0,0,1; 1,-1,-2,3]^n*[0;1;3;9])[1,1] \\ Charles R Greathouse IV, Mar 22 2016

vector(40, n, n--; f=fibonacci; f(n+4)+2*f(n+2)-(3*n+5)) \\ G. C. Greubel, Jul 12 2019

f=fibonacci; [f(n+4)+2*f(n+2)-(3*n+5) for n in (0..40)] # G. C. Greubel, Jul 12 2019

a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4).
From Bruno Berselli, Nov 16 2011: (Start)
G.f.: x*(1+2*x^2)/((1-x)^2*(1 - x - x^2)).
a(n) = ((25+13*t)*(1+t)^n + (25-13*t)*(1-t)^n)/(10*2^n) - 3*n - 5 = A000285(n+2) - 3*n - 5  where t=sqrt(5). (End)
a(n) = Fibonacci(n+4) + 2*Fibonacci(n+2) - (3*n+5). - G. C. Greubel, Jul 12 2019

A052952 a(n) = Fibonacci(n+2) - (1-(-1)^n)/2.

Original entry on oeis.org

1, 1, 3, 4, 8, 12, 21, 33, 55, 88, 144, 232, 377, 609, 987, 1596, 2584, 4180, 6765, 10945, 17711, 28656, 46368, 75024, 121393, 196417, 317811, 514228, 832040, 1346268, 2178309, 3524577, 5702887, 9227464, 14930352, 24157816, 39088169, 63245985, 102334155

Offset: 0

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

Equals row sums of triangle A173284. - Gary W. Adamson, Feb 14 2010
The Kn21 sums (see A180662 for definition) of the 'Races with Ties' triangle A035317 produce this sequence. - Johannes W. Meijer, Jul 20 2011
a(n-1), for n >= 1, gives the number of compositions of n with relative prime parts, and parts not exceeding 2. See the row sums of triangle A030528 where for even n the leading 1 is missing. - Wolfdieter Lang, Jul 27 2023

			G.f. = 1 + x + 3*x^2 + 4*x^3 + 8*x^4 + 12*x^5 + 21*x^6 + 33*x^7 + ...

Reinhard Zumkeller, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1023
K. Kuhapatanakul, On the Sums of Reciprocal Generalized Fibonacci Numbers, J. Int. Seq. 16 (2013) #13.7.1, eq (1).
Steven Linton, James Propp, Tom Roby, and Julian West, Equivalence Classes of Permutations under Various Relations Generated by Constrained Transpositions, Journal of Integer Sequences, Vol. 15 (2012), #12.9.1.
H. Ohtsuka and S. Nakamura, On the sum of reciprocal sums of Fibonacci numbers, Fibonacci Quart. 46/47 (2008/2009), 153-159.
Index entries for linear recurrences with constant coefficients, signature (1,2,-1,-1).

Cf. A062114, A173284, A059841, A014217, A180662, A035317.
Partial sums of A008346, first differences of A129696.
Cf. also A000032, A000045, A030528.
Cf. A001595, A054450, A066983, A074331, A168309.

List([0..40], n-> Fibonacci(n+2) -(1-(-1)^n)/2); # G. C. Greubel, Jul 10 2019

a052952 n = a052952_list !! n
a052952_list = 1 : 1 : zipWith (+)
   a059841_list (zipWith (+) a052952_list $ tail a052952_list)
-- Reinhard Zumkeller, Jan 06 2012

[Fibonacci(n+2)-(1-(-1)^n)/2: n in [0..40]]; // Vincenzo Librandi, Dec 02 2016

A052952 :=proc(n)
    option remember;
    local t1;
    if n <= 1 then
        return 1 ;
    fi:
    if n mod 2 = 1 then
        t1:=0
    else
        t1:=1;
    fi:
    procname(n-1)+procname(n-2)+t1;
end proc;
seq(A052952(n), n=0..40) ; # N. J. A. Sloane, May 25 2008

Table[Fibonacci[n+2] -(1-(-1)^n)/2, {n, 0, 40}] (* Vincenzo Librandi, Dec 02 2016 *)
Sum[(-1)^k*Fibonacci[Range[2,41], 1-k], {k,0,1}] (* G. C. Greubel, Oct 21 2019 *)
CoefficientList[Series[1/((1-x-x^2)*(1-x^2)),{x,0,40}],x] (* Harvey P. Dale, Sep 12 2020 *)

PARI
```
{a(n) = fibonacci(n+2) - n%2};
```

[fibonacci(n+2) -(1-(-1)^n)/2 for n in (0..40)] # G. C. Greubel, Jul 10 2019

G.f.: 1/((1-x-x^2)*(1-x^2)).
a(n) = A074331(n+1).
a(n) = A054450(n+1, 1) (second column of triangle).
a(n) = 2*a(n-2) + a(n-3) + 1, with a(0)=1, a(1)=1, a(2)=3.
a(n) = Sum_{alpha=RootOf(-1+z+z^2)} (3+alpha)*alpha^(-1-n)/3 - Sum_{beta=RootOf(-1+z^2)} beta^(-1-n)/2.
a(2*k) = Sum_{j=0..k} F(2*j+1) = F(2*(k+1)) for k >= 0; a(2*k-1) = Sum_{j=0..k} F(2*j) = F(2*k+1)-1 for k >= 1 (F = A000045, Fibonacci numbers).
a(n) = a(n-1) + a(n-2) + (1+(-1)^n)/2.
a(n) = Sum_{k=0..floor(n/2)} binomial(n-k+1, k). - Paul Barry, Oct 23 2004
a(n) = floor(phi^(n+2) / sqrt(5)), where phi is the golden ratio: phi = (1+sqrt(5))/2. - Reinhard Zumkeller, Apr 19 2005
a(n) = Fibonacci(n+1) + a(n-2) with n>1, a(0)=a(1)=1. - Zerinvary Lajos, Mar 17 2008
a(n) = floor(Fibonacci(n+3)^2/Fibonacci(n+4)). - Gary Detlefs, Nov 29 2010
a(n) = (A001595(n+3) - A066983(n+4))/2. - Gary Detlefs, Dec 19 2010
a(4*n) = F(4*n+2); a(4*n+1) = F(4*n+3) - 1; a(4*n+2) = F(4*n+4); a(4*n+3) = F(4*n+5) - 1. - Johannes W. Meijer, Jul 20 2011
a(n+1) = a(n) + a(n-1) + A059841(n+1). - Reinhard Zumkeller, Jan 06 2012
a(n) = floor(|F((1+i)*(n+2))|), n >= 0, with the complex Fibonacci function F: C -> C, z -> F(z) with F(z) := (exp(log(phi)*z) - exp(i*Pi*z)*exp(-log(phi)*z))/(2*phi-1) with the modulus |z|, the imaginary unit i and the golden section phi:=(1+sqrt(5))/2. A Conjecture: For F(z) see, e.g., the T. Koshy reference. ch. 45, p. 523, where F is called f, given in A000045. - Wolfdieter Lang, Jul 24 2012
5*a(n) = (L(n+3)-1)*(L(n+4)+3) -14 -Sum_{k=0..n} L(k+1)*L(k+5) = (L(n+3)-1)*(L(n+4)+3) -L(2*n+7) +A168309(n), where L=A000032. - J. M. Bergot, Jun 13 2014
a(n) = floor(phi*Fibonacci(n+1)), where phi is the golden section. - Michel Dekking, Dec 02 2016
a(n) = -(-1)^n * a(-4-n) for all n in Z. - Michael Somos, Dec 03 2016
a(n) = Sum_{k=0..n} Sum_{i=0..n} C(n-k-1,k-i). - Wesley Ivan Hurt, Sep 21 2017
a(n) = floor(1/(Sum_{k>=n+4} 1/Fibonacci(k))) [Ohtsuka and Nakamura]. - Michel Marcus, Aug 09 2018
a(n) = floor(abs(chebyshevU(n/2, 3/2))). - Federico Provvedi, Feb 23 2022
E.g.f.: exp(x/2)*(5*cosh(sqrt(5)*x/2) + 3*sqrt(5)*sinh(sqrt(5)*x/2))/5 - sinh(x). - Stefano Spezia, Mar 09 2024

Additional formulas and more terms from Wolfdieter Lang, May 02 2000

Better description from Olivier Gérard, Jun 05 2001

A109754 Matrix defined by: a(i,0) = 0, a(i,j) = i*Fibonacci(j-1) + Fibonacci(j), for j > 0; read by ascending antidiagonals.

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 3, 3, 0, 1, 4, 4, 5, 5, 0, 1, 5, 5, 7, 8, 8, 0, 1, 6, 6, 9, 11, 13, 13, 0, 1, 7, 7, 11, 14, 18, 21, 21, 0, 1, 8, 8, 13, 17, 23, 29, 34, 34, 0, 1, 9, 9, 15, 20, 28, 37, 47, 55, 55, 0, 1, 10, 10, 17, 23, 33, 45, 60, 76, 89, 89

Offset: 0

Ross La Haye, Aug 11 2005; corrected Apr 14 2006

Lower triangular version is at A117501. - Ross La Haye, Apr 12 2006

			Table starts:
[0] 0, 1,  1,  2,  3,  5,  8, 13,  21,  34, ...
[1] 0, 1,  2,  3,  5,  8, 13, 21,  34,  55, ...
[2] 0, 1,  3,  4,  7, 11, 18, 29,  47,  76, ...
[3] 0, 1,  4,  5,  9, 14, 23, 37,  60,  97, ...
[4] 0, 1,  5,  6, 11, 17, 28, 45,  73, 118, ...
[5] 0, 1,  6,  7, 13, 20, 33, 53,  86, 139, ...
[6] 0, 1,  7,  8, 15, 23, 38, 61,  99, 160, ...
[7] 0, 1,  8,  9, 17, 26, 43, 69, 112, 181, ...
[8] 0, 1,  9, 10, 19, 29, 48, 77, 125, 202, ...
[9] 0, 1, 10, 11, 21, 32, 53, 85, 138, 223, ...

G. C. Greubel, Table of n, a(n) for the first 50 rows, flattened

Rows: A000045(j); A000045(j+1), for j > 0; A000032(j), for j > 0; A000285(j-1), for j > 0; A022095(j-1), for j > 0; A022096(j-1), for j > 0; A022097(j-1), for j > 0. Diagonals: a(i, i) = A094588(i); a(i, i+1) = A007502(i+1); a(i, i+2) = A088209(i); Sum[a(i-j, j), {j=0...i}] = A104161(i). a(i, j) = A101220(i, 0, j).
Rows 7 - 19: A022098(j-1), for j > 0; A022099(j-1), for j > 0; A022100(j-1), for j > 0; A022101(j-1), for j > 0; A022102(j-1), for j > 0; A022103(j-1), for j > 0; A022104(j-1), for j > 0; A022106(j-1), for j > 0; A022107(j-1), for j > 0; A022108(j-1), for j > 0; A022109(j-1), for j > 0; A022110(j-1), for j > 0.
a(2^i-2, j+1) = A118654(i, j), for i > 0.
Cf. A117501.

A := (n, k) -> ifelse(k = 0, 0,
      n*combinat:-fibonacci(k-1) + combinat:-fibonacci(k)):
seq(seq(A(n - k, k), k = 0..n), n = 0..6); # Peter Luschny, May 28 2022

T[n_, 0]:= 0; T[n_, 1]:= 1; T[n_, 2]:= n - 1; T[n_, 3]:= n - 1; T[n_, n_]:= Fibonacci[n]; T[n_, k_]:= T[n, k] = T[n - 1, k - 1] + T[n - 2, k - 2]; Table[T[n, k], {n, 0, 15}, {k, 0, n}] (* G. C. Greubel, Jan 07 2017 *)

a(i, 0) = 0, a(i, j) = i*Fibonacci(j-1) + Fibonacci(j), for j > 0.
a(i, 0) = 0, a(i, 1) = 1, a(i, 2) = i+1, a(i, j) = a(i, j-1) + a(i, j-2), for j > 2.
G.f.: (x*(1 + ix))/(1 - x - x^2).
Sum_{j=0..i+1} a(i-j+1, j) - Sum_{j=0..i} a(i-j, j) = A001595(i). - Ross La Haye, Jun 03 2006

More terms from G. C. Greubel, Jan 07 2017

A104161 G.f.: x(1 - x + x^2)/((1-x)^2 (1 - x - x^2)).

Original entry on oeis.org

0, 1, 2, 5, 10, 19, 34, 59, 100, 167, 276, 453, 740, 1205, 1958, 3177, 5150, 8343, 13510, 21871, 35400, 57291, 92712, 150025, 242760, 392809, 635594, 1028429, 1664050, 2692507, 4356586, 7049123

Offset: 0

Creighton Dement, Mar 10 2005

A floretion-generated sequence.
Floretion Algebra Multiplication Program, FAMP Code: 1vesrokseq[ (- .25'i - .25i' - .25'ii' + .25'jj' + .25'kk' + .25'jk' + .25'kj' - .25e)('i + i' + 'ji' + 'ki' + e) ] RokType: Y[sqa.Findk()] = Y[sqa.Findk()] + p.
Partial sums of Leonardo numbers A001595. - Jonathan Vos Post, Jan 01 2011

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (3,-2,-1,1).

Cf. A000045, A006355, A001595, A117501, A145912.

List([0..40], n-> 2*Fibonacci(n+2) -(n+2)); # G. C. Greubel, Jul 09 2019

[2*Fibonacci(n+2) -(n+2): n in [0..40]]; // G. C. Greubel, Jul 09 2019

a=0;b=1;Table[c=b+a+n; a=b; b=c, {n,-1,40}] (* Vladimir Joseph Stephan Orlovsky, Jan 21 2011 *)
CoefficientList[Series[x*(1-x+x^2)/((1-x)^2*(1-x-x^2)),{x,0,40}],x] (* or *) LinearRecurrence[{3,-2,-1,1},{0,1,2,5},40] (* Harvey P. Dale, Sep 06 2012 *)

my(x='x+O('x^40)); concat(0, Vec(x*(1-x+x^2)/((1-x)^2*(1-x-x^2)))) \\ G. C. Greubel, Sep 26 2017

[2*fibonacci(n+2) -(n+2) for n in (0..40)] # G. C. Greubel, Jul 09 2019

Superseeker results (incomplete): a(2) - 2a(n+1) + a(n) = A006355(n+1) (Number of binary vectors of length n containing no singletons); a(n+1) - a(n) = A001595(n) (2-ranks of difference sets constructed from Segre hyperovals); a(n) + n + 1 = A001595(n+1).
A107909(a(n)) = A000975(n). - Reinhard Zumkeller, May 28 2005
From Ross La Haye, Aug 03 2005: (Start)
a(n) = 2*(Fibonacci(n+2) - 1) - n.
a(n) = Sum_{k=0..n} A101220(n-k, 0, k). (End)
From Gary W. Adamson, Apr 02 2006: (Start)
a(n) = a(n-1) + a(n-2) + n-1.
a(n) = row sums of A117501, starting (1, 2, 5, 10, ...). (End)
a(n) = Sum_{k=0..n} A109754(n-k,k). - Ross La Haye, Apr 12 2006
a(n) = (Sum_{k=0..n} (n-k)*Fibonacci(k-1) + Fibonacci(k)) - n. - Ross La Haye, May 31 2006
From R. J. Mathar, Apr 18 2008: (Start)
a(n) = -2 - n + (-A094214)^n*(1-A010499/5) + (1+A010499/5)/A094214^n.
a(n) = A006355(n+3) - n - 2. (End)
a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + a(n-4); a(0)=0, a(1)=1, a(2)=2, a(3)=5. - Harvey P. Dale, Sep 06 2012

cp's OEIS Frontend

A376081 Irregular triangle read by rows: row n is the periodic part of the Leonardo numbers (A001595) modulo n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A376082 a(n) is the period of the Leonardo numbers (A001595) modulo n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A117502 Triangle, row sums = A001595.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

Extensions

A375500 a(n) = Sum_{k=0..n} A001595(k)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A375501 a(n) = Sum_{k=0..n} (-1)^k*A001595(k)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A101220 a(n) = Sum_{k=0..n} Fibonacci(n-k)*n^k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula

Extensions

A192951 Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

A104161 G.f.: x(1 - x + x^2)/((1-x)^2 (1 - x - x^2)).