.NET Fiddle

FSharp · Script

/Program.fs

open System

let isPrime n =
  if n < 2 then false else

  let r = n |> float |> sqrt |> int
  seq { 2..r } |> Seq.forall (fun m -> n % m <> 0)

let testPrime () =
  assert (isPrime 2)
  assert (isPrime 19)
  assert (isPrime 4 |> not)

let rec digits n =
  seq {
    if n > 0 then
      yield! digits (n / 10)
      yield n % 10
  }

let testDigits () =
  assert (digits 0 |> Seq.isEmpty)
  assert (digits 2019 |> Seq.toList = [2; 0; 1; 9])

testDigits ()

let isSikuSiku n =
  digits n |> Seq.exists (fun d -> d = 4 || d = 9)

let testIsSikuSiku () =
  assert (isSikuSiku 42)
  assert (isSikuSiku 2019)
  assert (isSikuSiku 12356780 |> not)

let isSikuSikuPrime n =
  isSikuSiku n && isPrime n

let sikuSikuPrimes =
  seq {
    for n in 0..Int32.MaxValue do
      if isSikuSikuPrime n then
        yield n
  }

let N = Console.ReadLine() |> int
sikuSikuPrimes
|> Seq.take N
|> Seq.map string
|> String.concat ","
|> printfn "%s"
;