Comment by Nition

Here are the archived original 4chan posts: https://warosu.org/sci/thread/S3751105#p3751197

There are also a bunch of rather unfortunate new comments at the end of the archive from the last few days, when the link has obviously gained some public attention. However, in the midst of all the new nonsense, the recent one that begins "I think I solved it" is pretty interesting:

  --Anonymous Sun Oct 28 14:10:06 2018--

  I think I solved it.

  First calculate the max string which is the number of permutations multiplied by n.
  Then divide the max string by n - 1
  Then add to the answer the fibonacci number located at 2(n-3)
  
  int max_string = n! * n;
  int answer = max_string / (n - 1);
  answer += fib(2(n-3));
  
  Example for n = 5;
  
  max_string = 5! * 5 = 600
  answer = 600 / 4 = 150
  answer += fib(2(5-3)) = fib(4) = 3
  answer = 153
  
  Here is the first 14 using this method:
  
  2 -> 3
  3 -> 9
  4 -> 33
  5 -> 153
  6 -> 872
  7 -> 5901
  8 -> 46135
  9 -> 408384
  10 -> 4032377
  11 -> 43909467
  12 -> 522549784
  13 -> 6745945965
  14 -> 93884331311