Sieve of Eratosthenes get primers

import java.util.ArrayList;
import java.util.Scanner;

//Sieve of Eratosthenes
public class Primes {
    private static ArrayList<Integer> getPrimes(int n)
    {
        boolean[] isPrimes= new boolean[n+1];
        for(int i = 0; i <= n; i++)
            isPrimes[i] = true;
        
        ArrayList<Integer> primes = new ArrayList<Integer>();
        for(int k = 2; k <= n / k; k++)
            if(isPrimes[k])
            {
                for(int i = k; i <= n / k; i++)
                    isPrimes[k*i] = false;
            }
        for(int i = 2; i < n; i++)
            if(isPrimes[i])
                primes.add(i);
        return primes;
    }
    public static void main(String[] args)
    {
        System.out.println("Input a number and you'll get primers which is lower than it:");
        Scanner input = new Scanner(System.in);
        ArrayList<Integer> primers = new ArrayList<Integer>();
        primers = getPrimes(input.nextInt());
        for(int i = 0; i < primers.size(); i++)
        {
            if(i % 10 == 0)
                System.out.println();
            System.out.printf("%7d",primers.get(i));
        }
    }
}