Fibonacci numbers in OCaml

Example for versions OCaml 3.11

naive recursive solution 

let rec fibonacci n =
  if n < 3 then
    1
  else
    fibonacci (n-1) + fibonacci (n-2)

let () =
  for n = 1 to 16 do
    Printf.printf "%d\n" (fibonacci n)
  done;
  print_endline "..."