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
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, May 24 2002
STATUS
approved