A070973 Smallest integer k such that n divides floor((3/2)^k).

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

Offset

1,2

Comments

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.

Links

Harvey P. Dale, Table of n, a(n) for n = 1..1000

Formula

a(n) = min( k : A002379(k) == 0 mod(n) )

Mathematica

sik[n_]:=Module[{k=1}, While[!Divisible[Floor[(3/2)^k], n], k++]; k]; Array[sik, 70] (* Harvey P. Dale, Dec 15 2012 *)

Prog

(PARI) for(n=1, 100, s=1; while(floor((3/2)^s)%n>0, s++); print1(s, ", "))

Crossrefs

Cf. A002379.

Sequence in context: A292709 A097655 A080749 * A209593 A054496 A351748

Adjacent sequences: A070970 A070971 A070972 * A070974 A070975 A070976

Keyword

easy,nonn

Author

Benoit Cloitre, May 24 2002

Status

approved