Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych:  Lucas numbers
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

The distribution of second order linear recurrence sequences mod $2^m$

100%
Acta Arithmetica
|
1998
|
tom 83
|
nr 2
181-195
2
Content available remote

Sums of Powered Characteristic Roots Count Distance-Independent Circular Sets

75%
EN
Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the corresponding recurrence unless 2 ≤ n ≤ l. Lucas numbers L(n) are thus generalized since L(n) is the count in question if l = 1. Asymptotics of the count for 1 ≤ l ≤ 4 involves the golden ratio (if l = 1) and three of the four smallest Pisot numbers inclusive of the smallest of them, plastic number, if l = 4. It is shown that the transition from a recurrence to an OGF, or back, is best presented in terms of mutually reciprocal (shortly: coreciprocal) polynomials. Also the power sums of roots (i.e., moments) of a polynomial have the OGF expressed in terms of the co-reciprocal polynomial.
3
Content available remote

Some alternating sums of Lucas numbers

75%
Open Mathematics
|
2005
|
tom 3
|
nr 1
1-13
EN
We consider alternating sums of squares of odd and even terms of the Lucas sequence and alternating sums of their products. These alternating sums have nice representations as products of appropriate Fibonacci and Lucas numbers.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.