cp's OEIS Frontend

A069877 Smallest number with a prime signature whose indices are the decimal digits of n.

%I A069877 #40 Nov 19 2016 08:24:30
%S A069877 1,2,4,8,16,32,64,128,256,512,2,6,12,24,48,96,192,384,768,1536,4,12,
%T A069877 36,72,144,288,576,1152,2304,4608,8,24,72,216,432,864,1728,3456,6912,
%U A069877 13824,16,48,144,432,1296,2592,5184,10368,20736,41472,32,96,288,864,2592,7776,15552,31104,62208,124416,64,192,576,1728,5184,15552,46656,93312,186624,373248,128
%N A069877 Smallest number with a prime signature whose indices are the decimal digits of n.
%C A069877 From _Antti Karttunen_, Nov 17 2016: (Start)
%C A069877 This is a filter-sequence for decimal base: a(n) = the least number with the same prime signature as A054842(n).
%C A069877 This sequence can be used for filtering certain base-10 related sequences, because it matches only with any such sequence b that can be computed as b(n) = f(A054842(n)), where f(n) is any function that depends only on the prime signature of n (some of these are listed under the index entry for "sequences computed from exponents in ...").
%C A069877 Matching in this context means that the sequence a matches with the sequence b iff for all i, j: a(i) = a(j) => b(i) = b(j). In other words, iff the sequence b partitions the natural numbers to the same or coarser equivalence classes (as/than the sequence a) by the distinct values it obtains.
%C A069877 Any such sequence should match where the result is computed from the nonzero decimal digits of n, but does not depend on their order. These include for example, A007953 (digital sum and any of its variants), A010888 (digital root of n) and A051801 (product of the nonzero digits of n). As of Nov 11 2016, there were a couple of hundred such sequences that seemed to match with this one. These are given at the "List of sequences whose equivalence classes ..." link.
%C A069877 (End)
%H A069877 Antti Karttunen, <a href="/A069877/b069877.txt">Table of n, a(n) for n = 0..10000</a>
%H A069877 A. Karttunen, <a href="/A069877/a069877.txt">List of sequences whose equivalence classes seem to match with this sequence (as of Nov 11 2016)</a>
%H A069877 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a>
%F A069877 a(n) = A046523(A054842(n)). - _Antti Karttunen_, Nov 16 2016
%e A069877 a(12) = 2^2 * 3^1 = 12. a(231) = 2^3 * 3^2 * 5^1 = 360.
%Y A069877 Cf. A046523, A054842, A061509.
%Y A069877 Cf. A278222, A278226, A278236 for similar filter sequences constructed for other bases.
%Y A069877 Sequences that partition N into same or coarser equivalence classes: too numerous to list all here, but at least A007953, A010888, A051801 are included. See the separate list given in links.
%K A069877 nonn,base
%O A069877 0,2
%A A069877 _Amarnath Murthy_, Apr 25 2002
%E A069877 More terms from Larry Reeves (larryr(AT)acm.org), Jul 05 2002
%E A069877 a(0)=1 prepended and more terms added by _Antti Karttunen_, Nov 16 2016