  Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written
in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots,
n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the
minimum of $(n_1+\cdots+n_l)/\ord(g)$ over all possible $g\in G$ such that
$\langle g \rangle =G$.
  A conjecture on the index of length four sequences says that every minimal
zero-sum sequence of length 4 over a finite cyclic group $G$ with $\gcd(|G|,
6)=1$ has index 1. The conjecture was confirmed recently for the case when
$|G|$ is a product of at most two prime powers. However, the general case is
still open. In this paper, we make some progress towards solving the general
case. Based on earlier work on this problem, we show that if $G=\langle
g\rangle$ is a finite cyclic group of order $|G|=n$ such that $\gcd(n,6)=1$ and
$S=(x_1g)(x_2g)(x_3g)(x_4g)$ is a minimal zero-sum sequence over $G$ such that
$x_1,\cdots,x_4\in[1,n-1]$ with $\gcd(n,x_1,x_2,x_3,x_4)=1$, and
$\gcd(n,x_i)>1$ for some $i\in[1,4]$, then $\ind(S)=1$.
  By using an innovative method developed in this paper, we are able to give a
new (and much shorter) proof to the index conjecture for the case when $|G|$ is
a product of two prime powers.
