A378739 A378664(k) computed for those primitively abundant numbers k for which A378664(k) is less than the largest proper divisor of k.

6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 68, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 170, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 290, 646, 6, 6, 6, 6, 682, 6

Offset: 1

Author

Antti Karttunen, Dec 07 2024

Keywords

• nonn

Comments

Of the initial 20000 terms, 19803 are 6's.

Links

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

Crossrefs

Cf. A091191, A378664, A378738, A378740 (distinct terms in the order of appearance), A378741.

Formula

a(n) = A378664(A378738(n)).