In the paper is investigated the packing chromatic number for several specific graphs, e.g. for products of possibly infinite paths and for the infinite hexagonal lattice.