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 A137841 #7 Jul 25 2023 12:20:45 %S A137841 5,3125,298023223876953125, %T A137841 2350988701644575015937473074444491355637331113544175043017503412556834518909454345703125 %N A137841 Number of distinct n-ary operators in a quinternary logic. %C A137841 The total number of n-ary operators in a k-valued logic is T = k^(k^n), i.e. if S is a set of k elements, there are T ways of mapping an ordered subset of n elements taken from S to an element of S. Some operators are "degenerate": the operator has arity p, if only p of the n input values influence the output. = therefore the set of operators can be partitioned into n+1 disjoint subsets representing arities from 0 to n. %F A137841 a(n) = 5^(5^n). %Y A137841 Cf. A001146 (in binary logic), A055777 (in ternary logic), A137840 (in quaternary logic). %Y A137841 Subsequence of A000351. %K A137841 easy,nonn %O A137841 0,1 %A A137841 _Ross Drewe_, Feb 13 2008