|
Search: id:A079004
|
|
|
| A079004 |
|
Least x>=3 such that F(x)==1 (mod 3^n) where F(x) denote the x-th Fibonacci number (A000045). |
|
+0
5
|
|
| 7, 10, 10, 34, 106, 322, 970, 2914, 8746, 26242, 78730, 236194, 708586, 2125762, 6377290, 19131874, 57395626, 172186882, 516560650, 1549681954, 4649045866, 13947137602, 41841412810, 125524238434, 376572715306, 1129718145922
(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)=7 a(2)=10 a(3)=10 for n>3 a(n)=3*a(n-1)+4; a(n)=4*3^n-2
|
|
MATHEMATICA
|
a=2; lst={7, 10}; Do[a=a*3+4; AppendTo[lst, a], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 25 2008]
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, x=3; while((fibonacci(x)-1)%(3^n)>0, x++); x)
|
|
CROSSREFS
|
Cf. A003462, A007051, A034472, A024023, A067771, A029858, A134931, A115099, A100774 [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 25 2008]
Sequence in context: A122577 A070405 A010730 this_sequence A117319 A120645 A060228
Adjacent sequences: A079001 A079002 A079003 this_sequence A079005 A079006 A079007
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 01 2003
|
|
|
Search completed in 0.002 seconds
|
