cp's OEIS Frontend

A378740 Distinct values of A378664(k) in the order of appearance, when k ranges over those primitively abundant numbers k for which A378664(k) is less than the largest proper divisor of k.

%I A378740 #16 Dec 12 2024 15:15:01
%S A378740 6,68,170,290,646,682,754,370,410,430,470,530,4756,6844,8236,30566,
%T A378740 10730,11890,12470,43214,45182,46342,47386,15170,15370,54094,17110,
%U A378740 17690,62186,62894,19430,75686,79178,39530,89914,41890,43070,95282,97966,46610,103402,47570,106018,107602,107666,48970,109798,111386,51830
%N A378740 Distinct values of A378664(k) in the order of appearance, when k ranges over those primitively abundant numbers k for which A378664(k) is less than the largest proper divisor of k.
%C A378740 Term 1 does not occur in this sequence, thus all terms are in A341614, and also in A246282. See A378658, A378662, A378664, A378736 and A337372 for a proof.
%H A378740 Antti Karttunen, <a href="/A378740/b378740.txt">Table of n, a(n) for n = 1..20000</a>
%F A378740 a(n) = A378664(A378741(n)), a(n)| A378741(n).
%o A378740 (PARI)
%o A378740 \\ Uses program from A378738:
%o A378740 memoA378740 = Map();
%o A378740 k=0; n=0; while(k<200, n++; if(is_A378738(n), t=A378664(n); if(!mapisdefined(memoA378740, t), mapput(memoA378740, t, n); k++; print1(t, ", "); write("b378740.txt", k, " ", t))));
%Y A378740 Cf. A246282, A337372, A378658, A378662, A378664, A378736, A378738, A378739, A378741 (corresponding numbers of A091191).
%K A378740 nonn
%O A378740 1,1
%A A378740 _Antti Karttunen_, Dec 07 2024