This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A068845 #15 Dec 08 2015 02:47:58
%S A068845 1,3,1,1,1,7,1,29,17,43,29,13,47,19,73,37,19,41,31,41,31,1,1,37,31,37,
%T A068845 59,41,53,41,47,1,1,89,37,53,73,1,1,43,151,1,47,1,509,127,71,167,67,
%U A068845 167,149,67,61,139,67,59,107,241,1,61,1,149,293,127,71,151,337,107,1
%N A068845 Final digits of the smallest prime starting with n!.
%C A068845 a(n)= 1 or a(n) >= the smallest prime larger than n. Conjecture: The terms are noncomposite numbers. Motivation: a composite number not coprime to n! cannot be a member.
%D A068845 Amarnath Murthy, Smarandache Reciprocal function and an elementary inequality. Smarandache Notions Journal, Vol. 1-2-3, Spring 2000.
%e A068845 a(7) = 11 because the smallest prime starting with 7! = 5040 is 504011 and so the last digits are 11.
%p A068845 for i from 1 to 70 do a := nextprime(i!*10); b := 1; while(a-i!*10^b>=10^b) do b := b+1; a := nextprime(i!*10^b); end do; c[i] := a-i!*10^b; end do:q := seq(c[i],i=1..70);
%t A068845 Table[p = i!; k = 1; While[IntegerDigits[p] != Take[IntegerDigits[x = NextPrime[y = p*10^k]], IntegerLength[p]], k += 1]; x - y, {i, 69}] (* _Jayanta Basu_, Aug 09 2013 *)
%Y A068845 Cf. A068844.
%K A068845 nonn,base
%O A068845 1,2
%A A068845 _Amarnath Murthy_, Mar 10 2002
%E A068845 More terms from _Sascha Kurz_, Mar 17 2002