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.

6, 68, 170, 290, 646, 682, 754, 370, 410, 430, 470, 530, 4756, 6844, 8236, 30566, 10730, 11890, 12470, 43214, 45182, 46342, 47386, 15170, 15370, 54094, 17110, 17690, 62186, 62894, 19430, 75686, 79178, 39530, 89914, 41890, 43070, 95282, 97966, 46610, 103402, 47570, 106018, 107602, 107666, 48970, 109798, 111386, 51830

Offset: 1

Author

Antti Karttunen, Dec 07 2024

Keywords

• nonn

Comments

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.

Links

• Antti Karttunen, Table of n, a(n) for n = 1..20000

Crossrefs

Cf. A246282, A337372, A378658, A378662, A378664, A378736, A378738, A378739, A378741 (corresponding numbers of A091191).

Programs

PARI

\\ Uses program from A378738:
memoA378740 = Map();
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))));

Formula

a(n) = A378664(A378741(n)), a(n)| A378741(n).