Movatterモバイル変換


[0]ホーム

URL:


TOPICS
SearchClose
Search

Perrin Sequence


DOWNLOAD Mathematica NotebookDownloadWolfram Notebook

Theinteger sequence defined by the recurrence

 P(n)=P(n-2)+P(n-3)
(1)

with the initial conditionsP(0)=3,P(1)=0,P(2)=2. Thisrecurrence relation is the same as that for thePadovan sequence but with different initial conditions. The first few terms forn=0, 1, ..., are 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEISA001608).

FoxTrot by Bill Amend

The above cartoon (Amend 2005) shows an unconventional sports application of the Perrin sequence (right panel). (The left two panels instead apply theFibonacci numbers).

P(n) is the solution of a third-order linear homogeneousrecurrence equation havingcharacteristic equation

 x^3-x-1=0.
(2)

Denoting theroots of this equation byalpha,beta, andgamma, withalpha the unique real root, the solution is then

 P(n)=alpha^n+beta^n+gamma^n.
(3)

Here,

 alpha=(x^3-x-1)_1
(4)

is theplastic constantP, which is also given by the limit

 lim_(n->infty)(P(n))/(P(n-1))=P.
(5)

The asymptotic behavior ofP(n) is

 P(n)∼alpha^n.
(6)

The first few primes in this sequence are 2, 3, 2, 5, 5, 7, 17, 29, 277, 367, 853, ... (OEISA074788), which occur for termsn=2, 3, 4, 5, 6, 7, 10, 12, 20, 21, 24, 34, 38, 75, 122, 166, 236, 355, 356, 930, 1042, 1214, 1461, 1622, 4430, 5802, 9092, 16260, 18926, 23698, 40059, 45003, 73807, 91405, 263226, 316872, 321874, 324098, ... (OEISA112881), the largest of which areprobable primes and a number of which are summarized in the following table.

ndecimal digitsdiscovererdate
9140511163E. W. WeissteinOct. 6, 2005
26322632147E. W. WeissteinMay 4, 2006
31687238698E. W. WeissteinFeb. 4, 2007
32187439309E. W. WeissteinFeb. 19, 2007
32409839580E. W. WeissteinFeb. 25, 2007
58113270970E. W. WeissteinFeb. 15, 2011

Perrin (1899) investigated the sequence and noticed that ifn isprime, thenn|P(n) (i.e.,ndividesP(n)). The first statement of this fact is attributed to É. Lucas in 1876 by Stewart (1996). Perrin also searched for but did not find anycomposite numbern in the sequence such thatn|P(n). Such numbers are now known asPerrin pseudoprimes. Malo (1900), Escot (1901), and Jarden (1966) subsequently investigated the series and also found noPerrin pseudoprimes. Adams and Shanks (1982) subsequently found that271441 is such a number.


See also

Integer Sequence Primes,Padovan Sequence,Perrin Pseudoprime,Plastic Constant,Recurrence Relation Signature

Explore with Wolfram|Alpha

References

Adams, W. and Shanks, D. "Strong Primality Tests that Are Not Sufficient."Math. Comput.39, 255-300, 1982.Amend, B. "FoxTrot.com." Cartoon from Oct. 11, 2005.http://www.foxtrot.com/.Escot, E.-B. "Solution to Item 1484."L'Intermédiare des Math.8, 63-64, 1901.Jarden, D.Recurring Sequences: A Collection of Papers, Including New Factorizations of Fibonacci and Lucas Numbers. Jerusalem: Riveon Lematematika, 1966.Malo, E.L'Intermédiare des Math.7, 281 and 312, 1900.Perrin, R. "Item 1484."L'Intermédiare des Math.6, 76-77, 1899.Sloane, N. J. A. SequencesA001608/M0429,A074788, andA112881 in "The On-Line Encyclopedia of Integer Sequences."Stewart, I. "Tales of a Neglected Number."Sci. Amer.274, 102-103, June 1996.

Referenced on Wolfram|Alpha

Perrin Sequence

Cite this as:

Weisstein, Eric W. "Perrin Sequence."FromMathWorld--A Wolfram Resource.https://mathworld.wolfram.com/PerrinSequence.html

Subject classifications

Created, developed and nurtured by Eric Weisstein at Wolfram Research

[8]ページ先頭

©2009-2025 Movatter.jp