cp's OEIS Frontend

A325094 Write n as a sum of distinct powers of 2, then take the primes of those powers of 2 and multiply them together.

%I A325094 #10 Mar 28 2019 12:13:46
%S A325094 1,2,3,6,7,14,21,42,19,38,57,114,133,266,399,798,53,106,159,318,371,
%T A325094 742,1113,2226,1007,2014,3021,6042,7049,14098,21147,42294,131,262,393,
%U A325094 786,917,1834,2751,5502,2489,4978,7467,14934,17423,34846,52269,104538,6943
%N A325094 Write n as a sum of distinct powers of 2, then take the primes of those powers of 2 and multiply them together.
%C A325094 The sorted sequence is A325093.
%C A325094 For example, 11 = 1 + 2 + 8, so a(11) = prime(1) * prime(2) * prime(8) = 114.
%H A325094 Robert Israel, <a href="/A325094/b325094.txt">Table of n, a(n) for n = 0..10000</a>
%e A325094 The sequence of terms together with their prime indices begins:
%e A325094     1: {}
%e A325094     2: {1}
%e A325094     3: {2}
%e A325094     6: {1,2}
%e A325094     7: {4}
%e A325094    14: {1,4}
%e A325094    21: {2,4}
%e A325094    42: {1,2,4}
%e A325094    19: {8}
%e A325094    38: {1,8}
%e A325094    57: {2,8}
%e A325094   114: {1,2,8}
%e A325094   133: {4,8}
%e A325094   266: {1,4,8}
%e A325094   399: {2,4,8}
%e A325094   798: {1,2,4,8}
%e A325094    53: {16}
%e A325094   106: {1,16}
%e A325094   159: {2,16}
%e A325094   318: {1,2,16}
%e A325094   371: {4,16}
%p A325094 P:= [seq(ithprime(2^i),i=0..10)]:
%p A325094 f:= proc(n) local L,i;
%p A325094   L:= convert(n,base,2);
%p A325094   mul(P[i]^L[i],i=1..nops(L))
%p A325094 end proc:
%p A325094 map(f, [$0..100]); # _Robert Israel_, Mar 28 2019
%t A325094 Table[Times@@MapIndexed[If[#1==0,1,Prime[2^(#2[[1]]-1)]]&,Reverse[IntegerDigits[n,2]]],{n,0,100}]
%Y A325094 Cf. A000720, A001222, A005117, A018819, A019565, A033844, A056239, A102378, A112798, A247935, A318400.
%Y A325094 Cf. A325091, A325092, A325093, A325106.
%K A325094 nonn,look
%O A325094 0,2
%A A325094 _Gus Wiseman_, Mar 27 2019