Cullen Numbers in Binary Recurrent Sequences
چکیده
In this paper, we prove that the generalized Cullen numbers, Cn(s, l) := sn ·2+ l, where l is an integer and s := (sn)n≥0 is a sequence of integers satisfying log |sn| c1 we have log |Q| > |P |2 . Finally, we find all Cullen numbers, i.e., numbers of the form n ·2+1 and all Woodall numbers, i.e., the numbers of the form n · 2 − 1, that are either Fibonacci or Pell numbers. ∗Also Associated to the Institute of Mathematics of Romanian Academy, Bucharest, Romania 1