|
%I #12 Jan 28 2023 12:15:05
%S 1,2,3,5,7,11,14,22,26,34,44,55,68,85,110,130,170,190,242,290,374,418,
%T 506,638,748,836,1012,1276,1364,1628,1914,2090,2552,3190,3410,4070,
%U 4510,5060,6380,7018,8140,9020,9922,11396,14036,15004,17908,19844,21692,23452
%N Greatest positive integer whose reversed (weakly decreasing) prime indices have weighted sum (A318283) equal to n.
%C A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
%C The weighted sum of a sequence (y_1,...,y_k) is Sum_{i=1..k} i*y_i.
%e The terms together with their prime indices begin:
%e 1: {}
%e 2: {1}
%e 3: {2}
%e 5: {3}
%e 7: {4}
%e 11: {5}
%e 14: {1,4}
%e 22: {1,5}
%e 26: {1,6}
%e 34: {1,7}
%e 44: {1,1,5}
%e 55: {3,5}
%e 68: {1,1,7}
%e 85: {3,7}
%e 110: {1,3,5}
%e 130: {1,3,6}
%e 170: {1,3,7}
%e 190: {1,3,8}
%e 242: {1,5,5}
%e 290: {1,3,10}
%e The 6 numbers with weighted sum of reversed prime indices 9, together with their prime indices:
%e 18: {1,2,2}
%e 23: {9}
%e 25: {3,3}
%e 28: {1,1,4}
%e 33: {2,5}
%e 34: {1,7}
%e Hence a(9) = 34.
%t nn=10;
%t primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
%t ots[y_]:=Sum[i*y[[i]],{i,Length[y]}];
%t seq=Table[ots[Reverse[primeMS[n]]],{n,1,2^nn}];
%t Table[Position[seq,k][[-1,1]],{k,0,nn}]
%Y First position of n in A318283, unreversed A304818.
%Y The unreversed version is A359497.
%Y The least instead of greatest is A359679, unreversed A359682.
%Y A112798 lists prime indices, length A001222, sum A056239.
%Y A320387 counts multisets by weighted sum, zero-based A359678.
%Y A358136 lists partial sums of prime indices, ranked by A358137, rev A359361.
%Y Cf. A001248, A029931, A055932, A089633, A243055, A358194, A359043, A359676, A359681, A359755.
%K nonn
%O 0,2
%A _Gus Wiseman_, Jan 15 2023
%E More terms from _Jinyuan Wang_, Jan 26 2023
|
