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”).
%I #18 Feb 10 2022 20:06:36
%S 1,2,3,5,6,7,10,11,13,14,15,17,19,21,22,23,26,29,30,31,33,34,35,36,37,
%T 38,39,41,42,43,46,47,51,53,55,57,58,59,61,62,65,66,67,69,70,71,72,73,
%U 74,77,78,79,82,83,85,86,87,89,91,93,94,95,97,101,102,103,105,106,107,109,110,111,113,114,115,118,119
%N Numbers k such that A003968(k) is a multiple of k, where A003968 is multiplicative with a(p^e) = p*(p+1)^(e-1).
%C This is a subsequence of A333634. See comments in A347892.
%H Antti Karttunen, <a href="/A348499/b348499.txt">Table of n, a(n) for n = 1..20000</a>
%t f[p_, e_] := p*(p + 1)^(e - 1); s[n_] := Times @@ f @@@ FactorInteger[n]; Select[Range[120], Divisible[s[#], #] &] (* _Amiram Eldar_, Oct 29 2021 *)
%o (PARI)
%o A003968(n) = {my(f=factor(n)); for (i=1, #f~, p= f[i, 1]; f[i, 1] = p*(p+1)^(f[i, 2]-1); f[i, 2] = 1); factorback(f); }
%o isA348499(n) = !(A003968(n)%n);
%Y Union of A005117 and A347892 (terms that are not squarefree).
%Y Subsequence of A333634.
%Y Positions of ones in A348037.
%Y Cf. A003968, A348030, A348036, A347960.
%K nonn
%O 1,2
%A _Antti Karttunen_, Oct 29 2021