This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079003 Least x>=3 such that F(x)==-1 (mod 3^n) where F(x) denotes the x-th Fibonacci number (A000045). 1
 3, 6, 14, 38, 110, 326, 974, 2918, 8750, 26246, 78734, 236198, 708590, 2125766, 6377294, 19131878, 57395630, 172186886, 516560654, 1549681958, 4649045870, 13947137606, 41841412814, 125524238438, 376572715310, 1129718145926 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES R. L. Graham, D. E. Knuth and O. Patashnick, "Concrete Mathematics", second edition, Addison Wesley, ex.6.59 LINKS Vincenzo Librandi, Table of n, a(n) for n = 1..1000 Index entries for linear recurrences with constant coefficients, signature (4,-3). FORMULA a(1) = 3; for n>1, a(n) = 3*a(n-1)-4; a(n) = 4*3^(n-2)+2. a(n) = 4*a(n-1)-3*a(n-2) for n>3. G.f.: x*(3-6*x-x^2)/((1-x)*(1-3*x)). [Colin Barker, May 01 2012] MATHEMATICA CoefficientList[Series[(3-6*x-x^2)/((1-x)*(1-3*x)), {x, 0, 40}], x] (* Vincenzo Librandi, Jun 23 2012 *) PROG (PARI) a(n)=if(n<0, 0, x=3; while((fibonacci(x)+1)%(3^n)>0, x++); x) (MAGMA)  I:=[3, 6, 14, 38]; [n le 4 select I[n] else 4*Self(n-1) -3*Self(n-2): n in [1..30]]; // Vincenzo Librandi, Jun 23 2012 CROSSREFS Sequence in context: A100446 A106395 A261436 * A099966 A101162 A274054 Adjacent sequences:  A079000 A079001 A079002 * A079004 A079005 A079006 KEYWORD nonn,easy AUTHOR Benoit Cloitre, Feb 01 2003 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 October 15 04:33 EDT 2019. Contains 328026 sequences. (Running on oeis4.)