Cullen Numbers in Binary Recurrent Sequences

Florian Luca and Pantelimon Stănică

A chapter in Applications of Fibonacci Numbers, 2004, pp 167-175 from Springer

Abstract: Abstract Mentioned in the excellent book of R. Guy [5], the Cullen numbers are elements of the sequence C n := n·2 n + 1 (see Section B20 of [5]). They happen to be composite (see [2] and [8] ) for all 1 ≤ n n > 0 and a similar result holds for the Woodall numbers. Here, and elsewhere throughout this paper, we use the Vinogradov symbols ≫ and ≪, as well as the Landau symbols O and o with their usual meanings, and for a real number x ≥ 1 we use log x for the natural logarithm of x.

Keywords: 11B37; 11B39; 11B83; 11J86; 11K31 (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-306-48517-6_17

Ordering information: This item can be ordered from
http://www.springer.com/9780306485176

DOI: 10.1007/978-0-306-48517-6_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().