Logic Masters Deutschland e.V.

Fill the grid with 7 regions which do not touch orthogonally or diagonally and fill them with the digits 1 to 7. Divide the remainder of the grid into 15 regions, one of each size 1 to 15. Such a region may not contain repeated numbers, and it may only contain factors of its size (e.g. a region of size 6 may contain any combination of 1,2,3, and 6, including none of them).

A given digit within a (non-Meidjuluk) region counts the amount of cells it sees within its region, including itself. A given digit within a Meidjuluk region has no added meaning other than being a given.

Digits can not be repeated in rows and columns.

Link to Penpa

And here's a visual example for 4-regions with Meidjuluk N=8



Which can be solved Here

The solution code for column 3, row 6 for the example would be 621435554552371