Metraipolis › archive › dc_14dba2c82a71

Primefree sequence — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Primefree_sequence
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T17:23:10.158Z
SHA-256 of the archived text
e9aacaa4080fc82c23ce4e9711fdc476bc74e1054e35e2a154716860b4af155d
Stable URL of this page
https://metraipolis.com/documento/dc_14dba2c82a71

How to cite

Primefree sequence — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Primefree_sequence (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_14dba2c82a71 (Metraipolis archive dc_14dba2c82a71, sha256 e9aacaa4080fc82c23ce4e9711fdc476bc74e1054e35e2a154716860b4af155d)
BibTeX
@misc{dc14dba2c82a71,
  title = {Primefree sequence — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Primefree_sequence},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_14dba2c82a71; sha256 e9aacaa4080fc82c23ce4e9711fdc476bc74e1054e35e2a154716860b4af155d},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Primefree_sequence. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In mathematics, a primefree sequence is a sequence of integers that does not contain any prime numbers. More specifically, it usually means a sequence defined by the same recurrence relation as the Fibonacci numbers, but with different initial conditions causing all members of the sequence to be composite numbers that do not all have a common divisor. To put it algebraically, a sequence of this type is defined by an appropriate choice of two composite numbers a1 and a2, such that the greatest common divisor g c d ( a 1 , a 2 ) {\displaystyle \mathrm {gcd} (a_{1},a_{2})} is equal to 1, and such that for n > 2 {\displaystyle n>2} there are no primes in the sequence of numbers calculated from the formula a n = a n − 1 + a n − 2 {\displaystyle a_{n}=a_{n-1}+a_{n-2}} . The first primefree sequence of this type was published by Ronald Graham in 1964.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Number theory»).
Fonte: Wikipedia in inglese, voce «Primefree sequence» — https://en.wikipedia.org/wiki/Primefree_sequence
Wikidata Q7243388 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7243388
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Primefree_sequence?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378160149, consultata il 2026-10-07T16:54:19.892Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: ab8ae59110f0ee932d5dea8594b64787e2c5f0203b51cea6e61cdbdeaa254c2e