Lucas partitions
The Lucas sequence is defined by: L0=2,L1=1,Ln=Ln−1+Ln−2 for n≥2. Let V(n), r(n) denote respectively the number of partitions of n into parts, distinct parts from {Ln}. We develop formulas that facilitate the computation of V(n) and r(n).
Saved in:
Main Author: | Neville Robbins |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
1998-01-01
|
Series: | International Journal of Mathematics and Mathematical Sciences |
Online Access: | http://dx.doi.org/10.1155/S0161171298000532 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Lucas numbers of the form PX2, where P is prime
by: Neville Robbins
Published: (1991-01-01) -
Oscillatory Nonautonomous Lucas Sequences
by: José M. Ferreira, et al.
Published: (2010-01-01) -
Vieta's triangular array and a related family of polynomials
by: Neville Robbins
Published: (1991-01-01) -
Some congruence properties of binomial coefficients and linear second order recurrences
by: Neville Robbins
Published: (1988-01-01) -
Incomplete Bivariate Fibonacci and Lucas 𝑝-Polynomials
by: Dursun Tasci, et al.
Published: (2012-01-01)