This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229466 Numbers n such that the period of Fibonacci numbers mod n is 3*(n+10). 2
 10, 30, 70, 130, 370, 430, 670, 730, 970, 1030, 1270, 1570, 1630, 1930, 2230, 2770, 2830, 3130, 3370, 3670, 3730, 3970, 4330, 4570, 4630, 4870, 5230, 5470, 5770, 6070, 6130, 6430, 6730, 7270, 7330, 7570, 7870, 8230, 8530, 8770, 8830, 9070, 9370, 9970 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Related to Pisano periods. Other than the initial term 10, these are a subset of the terms of A071774 multiplied by 10, where A071774 are numbers m such that Fibonacci numbers mod m = 2*(m+1).  All A071774 terms multiplied by 10 have Pisano periods 3*(n+10) or (n+10). This sequence is the 3*(n+10) subset. A229467 is the n+10 subset. LINKS Matthew Goers, Table of n, a(n) for n = 1..74 EXAMPLE The Pisano period of the Fibonacci numbers mod 30 = 120, which is 3*(30+10). The Pisano period of the Fibonacci numbers mod 1570 = 4740, which is 3*(1570+10). MATHEMATICA t = {}; Do[a = {1, 0}; a0 = a; k = 0; While[k++; s = Mod[Plus @@ a, n]; a = RotateLeft[a]; a[[2]] = s; k <= 3*(n + 10) && a != a0]; If[k == 3*(n + 10), AppendTo[t, n]], {n, 2, 10000}]; t (* T. D. Noe, Oct 02 2013 *) CROSSREFS Cf. A000045, A001175, A071774, A229467. Sequence in context: A104044 A124080 A034127 * A269261 A005052 A057344 Adjacent sequences:  A229463 A229464 A229465 * A229467 A229468 A229469 KEYWORD nonn AUTHOR Matthew Goers, Sep 24 2013 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.