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 A262458 #8 Sep 23 2015 10:50:53 %S A262458 1,1,256,14348907,281474976710656,2910383045673370361328125, %T A262458 22452257707354557240087211123792674816, %U A262458 174251498233690814305510551794710260107945042018748343,1766847064778384329583297500742918515827483896875618958121606201292619776 %N A262458 Number of possible conjunction tables in the n-valued logics. %C A262458 In a conjunction table, the only requirements are (i) True ^ True = True; and (ii) no other conjunction gives True. So each of the other n^2-1 entries can be assigned any of n-1 non-True values, giving raise to the formula (n-1)^(n^2-1). %D A262458 H. Eves, C. V. Newsom, An Introduction to the Foundation and Fundamental concepts of Mathematics, Rinehart & Co., New York, 1958. %F A262458 a(n) = (n-1)^(n^2-1). %o A262458 (PARI) a(n)=(n-1)^(n^2-1) \\ _Charles R Greathouse IV_, Sep 23 2015 %Y A262458 Cf. A076728 (number of negation tables), A262459 (number of logics). %K A262458 nonn,easy %O A262458 1,3 %A A262458 _Max Alekseyev_, Sep 23 2015