login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

%I #9 Dec 07 2024 19:31:00

%S 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,

%T 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,

%U 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

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

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

%H Antti Karttunen, <a href="/A378739/b378739.txt">Table of n, a(n) for n = 1..20000</a>

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

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

%K nonn

%O 1,1

%A _Antti Karttunen_, Dec 07 2024