|
Search: id:A070973
|
|
|
| A070973 |
|
Smallest integer k such that n divides floor((3/2)^k). |
|
+0
2
|
|
| 1, 2, 3, 16, 4, 37, 5, 16, 38, 49, 6, 44, 40, 29, 50, 16, 7, 51, 9, 49, 30, 40, 15, 44, 8, 40, 52, 56, 36, 50, 23, 43, 41, 26, 20, 81, 43, 9, 41, 49, 16, 73, 11, 40, 51, 29, 63, 44, 34, 49, 225, 40, 224, 196, 27, 56, 10, 36, 45, 50, 126, 23, 74, 193, 279, 41, 76, 26, 30, 56
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n)=n for some n = 1,2,3,16,56,283,....Conjectures : (i) Log(n) < a(n) < n*Log(n)^2 for n>6; (ii) the equation a(x)=n always has a solution.
|
|
FORMULA
|
a(n) = min( k : A002379(k) == 0 mod(n) )
|
|
PROGRAM
|
(PARI) for(n=1, 100, s=1; while(floor((3/2)^s)%n>0, s++); print1(s, ", "))
|
|
CROSSREFS
|
Cf. A002379.
Adjacent sequences: A070970 A070971 A070972 this_sequence A070974 A070975 A070976
Sequence in context: A087975 A097655 A080749 this_sequence A054496 A088447 A103390
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), May 24 2002
|
|
|
Search completed in 0.002 seconds
|
