|
Search: id:A079003
|
|
|
| A079003 |
|
Least x>=3 such that F(x)==-1 (mod 3^n) where F(x) denote the x-th Fibonacci number (A000045). |
|
+0
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; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
R. L. Graham, D. E. Knuth and O. Patashnick, "Concrete Mathematics", second edition, Addison Wesley, ex.6.59
|
|
FORMULA
|
a(1)=3; for n>1, a(n)=3*a(n-1)-4; a(n)=4*3^(n-1)+2
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, x=3; while((fibonacci(x)+1)%(3^n)>0, x++); x)
|
|
CROSSREFS
|
Sequence in context: A001550 A100446 A106395 this_sequence A099966 A101162 A059741
Adjacent sequences: A079000 A079001 A079002 this_sequence A079004 A079005 A079006
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 01 2003
|
|
|
Search completed in 0.002 seconds
|
