As said in the comments, your construction is not what usually is called a block cipher.
A block cipher is a pair of (deterministic) functions with just two inputs: key and plaintext or ciphertext.
Your function has an additional input, the block number.
One could name this a tweakable block cipher (i.e. $n$ is the "tweak"):
$$ Enc_k^n(P) = P \oplus H(k, n)$$
$$ Dec_k^n(P) = P \oplus H(k, n)$$
(This construction is a quite bad tweakable block cipher, since it is linear in $P$ and as such easily distinguishable from a pseudorandom permutation, as mentioned in the comment from Ilmari Karonen.)
There are modes of operation for tweakable block ciphers, too, and If I understand right, you just invented your own mode as a combination of counter and CBC mode, like this:
$$ C_n = Enc_k^n(P_n \oplus C_{n-1}) $$
$$ P_n = Dec_k^n(C_n) \oplus C_{n-1} $$
But with your construction of a tweakable block cipher this reduced to
$$ C_n = C_{n-1} \oplus P_n \oplus H(k || n) $$
$$ P_n = C_{n-1} \oplus C_n \oplus H(K || n) $$
The effect is that the actual initialization vector can be canceled out simply by XORing it, so it doesn't fulfill the function of making the encryption unique.
Another way of viewing your description is as using a hash function in counter mode. As mentioned, you'll should include an initialization vector, and this should come as an input into the hash function. One way would be this:
$$ C_n = H(k || IV || n) \oplus P_n$$
Provided your hash function behaves like a pseudorandom function (when used with the key), this will be of similar security as using a block cipher in counter mode.
(The more standard way of counter mode would be to start the $n$ counter input (but not the block number) at the initialization vector instead of 0. I think both ways don't differ in security.)