AbstractLet {an}n = 0∞ be an integer sequence defined by the non-degenerate binary linear recurrence an = A an − 1 + Ban − 2, where a0 = 0, a1 ≠ 0, and A, B are fixed non-zero integers. It is proved, for a certain constant κ, that 6(1−K)log|a1a2…aN|log[A1,a2,…,aN]12=π+01logn, which is the generalization of the formula of P. Kiss and F. Mátyás
AbstractWe obtain asymptotic formulas for all the moments of certain arithmetic functions with linea...
AbstractThe asymptotic value as n→∞ of the number b(n) of inequivalent binary n-codes is determined....
For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibon...
AbstractLet R0, R1, R2,… be a nondegenerate binary linear recurrence of integers defined by Rn = ARn...
AbstractLet {an}n = 0∞ be an integer sequence defined by the non-degenerate binary linear recurrence...
AbstractIn previous work we have shown that the binomial coefficients Cn··kr, r are strongly logarit...
While a different topic was investigated, it became necessary to know asymptotic values of products ...
AbstractAn asymptotic formula, having bounded relative error, is developed for the numerical sequenc...
AbstractWe prove a lemma regarding the linear independence of certain vectors and use it to improve ...
AbstractFor a complex number s and an arithmetical function α, we write A(n) = Σdδ = nα(d) δs and A∗...
AbstractLet P = {pj}j=1∞, where 1 < p1 ≤ p2 ≤ …, pj → ∞. Following Beurling [Acta Math, 1937], we ca...
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
AbstractLet A be an infinite sequence of positive integers a1 < a2 <… and put fA(x) = Σa∈A, a≤x(1a),...
Let F and G be linear recurrences over a number field K, and let R be a finitely generated subring ...
AbstractAsymptotic results are obtained for pA(k)(n), the kth difference of the function pA(n) which...
AbstractWe obtain asymptotic formulas for all the moments of certain arithmetic functions with linea...
AbstractThe asymptotic value as n→∞ of the number b(n) of inequivalent binary n-codes is determined....
For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibon...
AbstractLet R0, R1, R2,… be a nondegenerate binary linear recurrence of integers defined by Rn = ARn...
AbstractLet {an}n = 0∞ be an integer sequence defined by the non-degenerate binary linear recurrence...
AbstractIn previous work we have shown that the binomial coefficients Cn··kr, r are strongly logarit...
While a different topic was investigated, it became necessary to know asymptotic values of products ...
AbstractAn asymptotic formula, having bounded relative error, is developed for the numerical sequenc...
AbstractWe prove a lemma regarding the linear independence of certain vectors and use it to improve ...
AbstractFor a complex number s and an arithmetical function α, we write A(n) = Σdδ = nα(d) δs and A∗...
AbstractLet P = {pj}j=1∞, where 1 < p1 ≤ p2 ≤ …, pj → ∞. Following Beurling [Acta Math, 1937], we ca...
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
AbstractLet A be an infinite sequence of positive integers a1 < a2 <… and put fA(x) = Σa∈A, a≤x(1a),...
Let F and G be linear recurrences over a number field K, and let R be a finitely generated subring ...
AbstractAsymptotic results are obtained for pA(k)(n), the kth difference of the function pA(n) which...
AbstractWe obtain asymptotic formulas for all the moments of certain arithmetic functions with linea...
AbstractThe asymptotic value as n→∞ of the number b(n) of inequivalent binary n-codes is determined....
For every nonnegative integer $n$, let $r_F(n)$ be the number of ways to write $n$ as a sum of Fibon...
DOI
Add to ORKG