A027964 -id:A027964 - cp's OEIS frontend

A053298 Partial sums of A027964.

1, 8, 34, 107, 281, 654, 1397, 2801, 5353, 9859, 17643, 30869, 53062, 89951, 150833, 250780, 414210, 680665, 1114160, 1818310, 2960806, 4813018, 7814074, 12674542, 20544191, 33283434, 53902532, 87272241, 141273663, 228658744

Offset: 0

Barry E. Williams, Mar 04 2000

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-14,15,-5,-4,4,-1)

Cf. A027964 and A000204.
A column in triangular array A027960.
Cf. A137176 (row k=5).

m:=25; R:=PowerSeriesRing(Integers(), m); Coefficients(R!((1+2*x)/((1-x-x^2)*(1-x)^5))); // G. C. Greubel, May 24 2018

LinearRecurrence[{6,-14,15,-5,-4,4,-1},{1,8,34,107,281,654,1397},30] (* Harvey P. Dale, May 09 2018 *)
CoefficientList[Series[(1+2x)/((1-x-x^2)(1-x)^5), {x,0,50}], x] (* G. C. Greubel, May 24 2018 *)

x='x+O('x^30); Vec((1+2*x)/((1-x-x^2)*(1-x)^5)) \\ G. C. Greubel, May 24 2018

a(n) = 3*F(n+10) + F(n+9) - (3*n^4 + 58*n^3 + 489*n^2 + 2234*n + 4752)/24, where F(.) are the Fibonacci numbers (A000045).
a(n) = a(n-1) + a(n-2) + (3*n+4)*C(n+3, 3)/4.
G.f.: (1 + 2*x)/((1 - x - x^2)*(1 - x)^5). - R. J. Mathar, Nov 28 2008

A027960 'Lucas array': triangular array T read by rows.

Original entry on oeis.org

1, 1, 3, 1, 1, 3, 4, 4, 1, 1, 3, 4, 7, 8, 5, 1, 1, 3, 4, 7, 11, 15, 13, 6, 1, 1, 3, 4, 7, 11, 18, 26, 28, 19, 7, 1, 1, 3, 4, 7, 11, 18, 29, 44, 54, 47, 26, 8, 1, 1, 3, 4, 7, 11, 18, 29, 47, 73, 98, 101, 73, 34, 9, 1, 1, 3, 4, 7, 11, 18, 29, 47, 76, 120, 171, 199, 174, 107, 43, 10, 1

Offset: 0

Clark Kimberling

The k-th row contains 2k+1 numbers.
Columns in the right half consist of convolutions of the Lucas numbers with the natural numbers.
T(n,k) = number of strings s(0),...,s(n) such that s(n)=n-k. s(0) in {0,1,2}, s(1)=1 if s(0) in {1,2}, s(1) in {0,1,2} if s(0)=0 and for 1 <= i <= n, s(i) = s(i-1)+d, with d in {0,2} if s(i)=2i, in {0,1,2} if s(i)=2i-1, in {0,1} if 0 <= s(i) <= 2i-2.

			                           1
                       1,  3,  1
                   1,  3,  4,  4,  1
               1,  3,  4,  7,  8,  5,   1
           1,  3,  4,  7, 11, 15, 13,   6,  1
        1, 3,  4,  7, 11, 18, 26, 28,  19,  7,  1
     1, 3, 4,  7, 11, 18, 29, 44, 54,  47, 26,  8, 1
  1, 3, 4, 7, 11, 18, 29, 47, 73, 98, 101, 73, 34, 9, 1

Nathaniel Johnston, Table of n, a(n) for n = 0..10000

Central column is the Lucas numbers without initial 2: A000204.
Columns in the right half include A027961, A027962, A027963, A027964, A053298.
Bisection triangles are in A026998 and A027011.
Row sums: A036563, A153881 (alternating sign).
Sums include: A023537, A027973, A027974, A027975, A027976, A027978, A027979, A027980, A027981, A027982, A027984, A027985, A027986, A027987, A053298.
Diagonals of the form T(n, 2*n-p): A000012 (p=0), A000027 (p=1), A034856 (p=2), A027965 (p=3), A027966 (p=4), A027967 (p=5), A027968 (p=6), A027969 (p=7), A027970 (p=8), A027971 (p=9), A027972 (p=10).
Diagonals of the form T(n, n+p): A000032 (p=0), A027961 (p=1), A023537 (p=2), A027963 (p=3), A027964 (p=4), A053298 (p=5), A027002 U A027018 (p=6), A027007 U A027014 (p=7), A027003 U A027019 (p=8).
Cf. A000032, A004396, A026998, A027011, A027977, A075193, A168616.

function T(n,k) // T = A027960
      if k le n then return Lucas(k+1);
      elif k gt 2*n then return 0;
      else return T(n-1, k-2) + T(n-1, k-1);
      end if;
end function;
[T(n,k): k in [0..2*n], n in [0..12]]; // G. C. Greubel, Jun 08 2025

T:=proc(n,k)option remember:if(k=0 or k=2*n)then return 1:elif(k=1)then return 3:else return T(n-1,k-2) + T(n-1,k-1):fi:end:
for n from 0 to 6 do for k from 0 to 2*n do print(T(n,k));od:od: # Nathaniel Johnston, Apr 18 2011

(* First program *)
t[, 0] = 1; t[, 1] = 3; t[n_, k_] /; (k == 2*n) = 1; t[n_, k_] := t[n, k] = t[n-1, k-2] + t[n-1, k-1]; Table[t[n, k], {n, 0, 8}, {k, 0, 2*n}] // Flatten (* Jean-François Alcover, Dec 27 2013 *)
(* Second program *)
f[n_, k_]:= f[n,k]= Sum[Binomial[2*n-k+j,j]*LucasL[2*(k-n-j)], {j,0,k-n-1}];
A027960[n_, k_]:= LucasL[k+1] - f[n,k]*Boole[k>n];
Table[A027960[n,k], {n,0,12}, {k,0,2*n}]//Flatten (* G. C. Greubel, Jun 08 2025 *)

T(r,n)=if(r<0||n>2*r,return(0)); if(n==0||n==2*r,return(1)); if(n==1,3,T(r-1,n-1)+T(r-1,n-2)) /* Ralf Stephan, May 04 2005 */

@CachedFunction
def T(n, k): # T = A027960
    if (k>2*n): return 0
    elif (kG. C. Greubel, Jun 01 2019; Jun 08 2025

T(n, k) = Lucas(k+1) for k <= n, otherwise the (2n-k)th coefficient of the power series for (1+2*x)/{(1-x-x^2)*(1-x)^(k-n)}.
Recurrence: T(n, 0)=T(n, 2n)=1 for n >= 0; T(n, 1)=3 for n >= 1; and for n >= 2, T(n, k) = T(n-1, k-2) + T(n-1, k-1) for 2 <= k <= 2*n-1.
From G. C. Greubel, Jun 08 2025: (Start)
T(n, k) = A000032(k+1) - f(n, k)*[k > n], where f(n, k) = Sum_{j=0..k-n-1} binomial(2*n -k+j, j)*A000032(2*(k-n-j)).
Sum_{k=0..A004396(n+1)} T(n-k, k) = A027975(n).
Sum_{k=0..n} T(n, k) = A027961(n).
Sum_{k=0..2*n} T(n, k) = A168616(n+2) + 2.
Sum_{k=n+1..2*n} (-1)^k*T(n, k) = A075193(n-1), n >= 1. (End)

Edited by Ralf Stephan, May 04 2005

A027963 T(n,n+3), T given by A027960.

Original entry on oeis.org

1, 6, 19, 47, 101, 199, 370, 661, 1148, 1954, 3278, 5442, 8967, 14696, 23993, 39065, 63483, 103025, 167040, 270655, 438346, 709716, 1148844, 1859412, 3009181, 4869594, 7879855, 12750611, 20631713, 33383659, 54016798, 87401977, 141420392, 228824086, 370246298, 599072310, 969320643

Offset: 3

Clark Kimberling

nonn

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

Cf. A000032.

List([3..40], n-> Lucas(1,-1,n+4)[2] - (3*n^2+5*n+14)/2 ) # G. C. Greubel, Jun 01 2019

[Lucas(n+4) -(3*n^2+5*n+14)/2: n in [3..40]]; // G. C. Greubel, Jun 01 2019

t[, 0] = 1; t[, 1] = 3; t[n_, k_] /; (k == 2*n) = 1; t[n_, k_] := t[n, k] = t[n-1, k-2] + t[n-1, k-1]; Table[t[n, n+3], {n, 3, 33}]  (* Jean-François Alcover, Dec 27 2013 *)
Table[LucasL[n+4] -(3*n^2+5*n+14)/2, {n,3,40}] (* G. C. Greubel, Jun 01 2019 *)

{a(n) = fibonacci(n+5) + fibonacci(n+3) - (3*n^2+5*n+14)/2}; \\ G. C. Greubel, Jun 01 2019

[lucas_number2(n+4,1,-1) - (3*n^2+5*n+14)/2 for n in (3..40)] # G. C. Greubel, Jun 01 2019

G.f.: x^3*(1+2*x)/((1-x)^3*(1-x-x^2)). Differences of A027964. - Ralf Stephan, Feb 07 2004

a(n) = Lucas(n+4) - (3*n^2 + 5*n + 14)/2.

Terms a(34) onward added by G. C. Greubel, Jun 01 2019

A137176 Hyperlucas number array T(r,n) = L(n)^(r), read by ascending antidiagonals (r >= 0, n >= 0).

Original entry on oeis.org

0, 0, 1, 0, 1, 3, 0, 1, 4, 4, 0, 1, 5, 8, 7, 0, 1, 6, 13, 15, 11, 0, 1, 7, 19, 28, 26, 18, 0, 1, 8, 26, 47, 54, 44, 29, 0, 1, 9, 34, 73, 101, 98, 73, 47, 0, 1, 10, 43, 107, 174, 199, 171, 120, 76, 0, 1, 11, 53, 150, 281, 373, 370, 291, 196, 123

Offset: 0

Jonathan Vos Post, Apr 04 2008

In Theorem 17, Dil and Mezo (2008) connect the hyperlucas numbers (this array) with the incomplete Lucas numbers (A324242). - Petros Hadjicostas, Sep 03 2019

			The array T(r,n) = L(n)^(r) begins:
.....|n=0|n=1|.n=2|.n=3|.n=4.|.n=5.|..n=6.|.n=7..|..n=8..|..n=9..|.n=10..|.in.OEIS
r=0..|.0.|.1.|..3.|..4.|...7.|..11.|...18.|...29.|....47.|....76.|...123.|.A000204
r=1..|.0.|.1.|..4.|..8.|..15.|..26.|...44.|...73.|...120.|...196.|...319.|.A027961
r=2..|.0.|.1.|..5.|.13.|..28.|..54.|...98.|..171.|...291.|...487.|...806.|.A023537
r=3..|.0.|.1.|..6.|.19.|..47.|.101.|..199.|..370.|...661.|..1148.|..1954.|.A027963
r=4..|.0.|.1.|..7.|.26.|..73.|.174.|..373.|..743.|..1404.|..2552.|..4506.|.A027964
r=5..|.0.|.1.|..8.|.34.|.107.|.281.|..654.|.1397.|..2801.|..5353.|..9859.|.A053298
r=6..|.0.|.1.|..9.|.43.|.150.|.431.|.1085.|.2482.|..5283.|.10636.|.20495.|.new
r=7..|.0.|.1.|.10.|.53.|.203.|.634.|.1719.|.4201.|..9484.|.20120.|.40615.|.new
r=8..|.0.|.1.|.11.|.64.|.267.|.901.|.2620.|.6821.|.16305.|.36425.|.77040.|.new
r=9..|.0.|.1.|.12.|.76.|.343.|1244.|.3864.|10685.|.26990.|.63415.|140455.|.new
For example, T(4,5) = L(5)^(4) = L(0)^(3) + L(1)^(3) + L(2)^(3) + L(3)^(3) + L(4)^(3) + L(5)^(3) = 0 + 1 + 6 + 19 + 47 + 101 = 174. - _Petros Hadjicostas_, Sep 03 2019

Ayhan Dil and Istvan Mezo, A Symmetric Algorithm for Hyperharmonic and Fibonacci Numbers, arXiv:0803.4388 [math.NT], 2008.
Ayhan Dil and Istvan Mezo, A Symmetric Algorithm for Hyperharmonic and Fibonacci Numbers, Applied Mathematics and Computation 206(2) (2008), 942-951.
Eric W. Weisstein, Steenrod Algebra.

Cf. A000204, A027961, A023537, A027963, A027964, A053298, A123736, A136431.

Cf. A038730, A038792, and A134511 for incomplete Fibonacci sequences, and A324242 for incomplete Lucas sequences.

L:= proc(r, n) option remember; `if`(n=0, 0, `if`(r=0,
      `if`(n<3, 2*n-1, L(0, n-2)+L(0, n-1)), L(r-1, n)+L(r, n-1)))
    end:
seq(seq(L(d-n, n), n=0..d), d=0..12);  # Alois P. Heinz, Sep 03 2019

L[r_, n_] := L[r, n] = If[n == 0, 0, If[r == 0, If[n < 3, 2n-1, L[0, n-2] + L[0, n-1]], L[r-1, n] + L[r, n-1]]];
Table[L[d-n, n], {d, 0, 12}, {n, 0, d}] // Flatten (* Jean-François Alcover, Sep 26 2019, from Maple *)

T(r,n) = L(n)^(r) = Apply partial sum operator r times to Lucas numbers A000204.
From Petros Hadjicostas, Sep 03 2019: (Start)
T(r, n) = L(n)^(r) = Sum_{k = 0..n} L(k)^(r-1) for r >= 1, with T(0,n) = L(n)^(0) = L(n) = A000204(n), T(r,0) = L(0)^(r) = 0, and T(r,1) = L(1)^(r) = 1. (See Definition 13 in Dil and Mezo (2008).)
G.f. for row r: Sum_{n >= 0} L(n)^(r)*t^n = t * (1+2*t)/((1-t-t^2) * (1-t)^r). (Corrected from Proposition 14 in Dil and Mezo (2008).)
(End)

A027001 a(n) = T(2*n, n+2), T given by A026998.

Original entry on oeis.org

1, 26, 174, 743, 2552, 7784, 22193, 60882, 163430, 433495, 1142496, 3001056, 7869649, 20619098, 54001422, 141401879, 370224248, 969294632, 2537687585, 6643800690, 17393752166, 45537499111, 119218794624, 312118940928, 817138091617, 2139295405274

Offset: 2

Clark Kimberling

Colin Barker, Table of n, a(n) for n = 2..1000
Index entries for linear recurrences with constant coefficients, signature (7,-19,26,-19,7,-1).

Bisection of A027964.

Cf. A000032, A000045, A026998.

[3*Fibonacci(2*n+10)-2*Fibonacci(2*n+9)-Fibonacci(2*n+8)-4*n^3-26*n^2-68*n-75: n in [0..30]]; // Vincenzo Librandi, Feb 19 2016

LinearRecurrence[{7, -19, 26, -19, 7, -1}, {1, 26, 174, 743, 2552, 7784}, 30] (* Vincenzo Librandi, Feb 19 2016 *)

Vec(x^2*(1+x)*(1+18*x-7*x^2)/((1-x)^4*(1-3*x+x^2)) + O(x^40)) \\ Colin Barker, Feb 18 2016

def A027001(n): return lucas_number2(2*n+5,1,-1) -(4*(n+1)**3 -10*n**2 +7)
print([A027001(n) for n in range(2,41)]) # G. C. Greubel, Jul 20 2025

a(n+2) = 3*F(2*n+10) - 2*F(2*n+9) - F(2*n+8) -(4*n^3 +26*n^2 +68*n +75), n >= 0, F(n) = A000045(n). - Ralf Stephan, Feb 07 2004
From Colin Barker, Feb 18 2016: (Start)
a(n) = 2^(-1-n)*( (11-5*sqrt(5))*(3-sqrt(5))^n + (11+5*sqrt(5))*(3+sqrt(5))^n ) - 11 - 12*n - 2*n^2 - 4*n^3.
G.f.: x^2*(1+x)*(1+18*x-7*x^2) / ((1-x)^4*(1-3*x+x^2)). (End)
From G. C. Greubel, Jul 20 2025: (Start)
a(n) = Lucas(2*n+5) - (4*(n+1)^3 - 10*n^2 + 7), n >= 2.
E.g.f.: exp(3*x/2)*(11*cosh(p*x) + 10*p*sinh(p*x)) - (4*x^3 + 14*x^2 + 18*x + 11)*exp(x), where 2*p = sqrt(5). (End)

cp's OEIS Frontend

A053298 Partial sums of A027964.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A027960 'Lucas array': triangular array T read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

SageMath

Formula

Extensions

A027963 T(n,n+3), T given by A027960.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Magma

Mathematica

PARI

Sage

Formula

Extensions

A137176 Hyperlucas number array T(r,n) = L(n)^(r), read by ascending antidiagonals (r >= 0, n >= 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A027001 a(n) = T(2*n, n+2), T given by A026998.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

SageMath

Formula