reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
<a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>.
<a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>.
a[n_] := Module[{k = n, m = 2, r, s = {}}, While[{k, r} = QuotientRemainder[k, m]; k != 0|| r != 0, AppendTo[s, r]; m++]; s = ReverseSort[s]; Times @@ (Prime[Range[Length[s]]] ^ s)]; Array[a, 100, 0] (* Amiram Eldar, Feb 07 2024 *)
approved
editing
Antti Karttunen, <a href="/A278236/b278236_1.txt">Table of n, a(n) for n = 0..40320</a>
proposed
approved
editing
proposed
Any such sequence should match where the result is computed from the nonzero digits (that may also be > 9) in the factorial base representation of n, but does not depend on their order. Some of these are listed on the last line of the Crossrefs- section.
proposed
editing
editing
proposed
Filter-sequence for factorial base (digit values): least number with the same prime signature as A276076(n).
Note that as A275735 is present in that list it means that the sequences matching to its sentinel filter-sequence A278235 form a subset of the sequences matching to this sequence. Also, for A275735 there is a stronger condition that for any i, j: a(i) = a(j) <=> A275735(i) = A275735(j), which if true, would imply that there is an injective function f such that f(A275735(n)) = A278236(n), and indeed, this function seems to be A181821.