This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023163 Fibonacci(p) == -2 (mod p). 3
 1, 9, 39, 111, 129, 159, 201, 249, 321, 471, 489, 519, 591, 681, 831, 849, 879, 921, 951, 1041, 1119, 1191, 1329, 1401, 1569, 1641, 1671, 1689, 1761, 1839, 1929, 1959, 2031, 2049, 2199, 2271, 2319, 2361, 2391, 2481, 2559, 2631, 2649, 2721, 2841, 2991, 3039 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Robert Israel, Table of n, a(n) for n = 1..1000 MAPLE pp:= n -> mpow(n-1, n)[2, 2]: M:= <<0, 1>|<1, 1>>: mpow:= proc(n, p)   if n = 0 then <<1, 0>|<0, 1>>   elif n::even then procname(n/2, p)^2 mod p   else  procname((n-1)/2, p)^2 . M mod p   fi end proc: select(p -> fpp(p)+2 mod p = 0, [1, seq(i, i=3..10000, 3)]); # Robert Israel, Feb 01 2017 CROSSREFS Sequence in context: A281381 A226449 A299280 * A054121 A139594 A034263 Adjacent sequences:  A023160 A023161 A023162 * A023164 A023165 A023166 KEYWORD nonn AUTHOR 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 12 01:57 EST 2019. Contains 329948 sequences. (Running on oeis4.)