cp's OEIS Frontend

A366994 The largest divisor of n that is not a term of A322448.

%I A366994 #11 Nov 02 2023 10:27:43
%S A366994 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,8,17,18,19,20,21,22,23,24,25,26,
%T A366994 27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,24,49,
%U A366994 50,51,52,53,54,55,56,57,58,59,60,61,62,63,32,65,66,67,68
%N A366994 The largest divisor of n that is not a term of A322448.
%C A366994 First differs from A365683 at n = 64.
%C A366994 The largest divisor of n whose prime factorization has exponents that are all either 1 or primes.
%C A366994 The number of these divisors is A366991(n) and their sum is A366992(n).
%H A366994 Amiram Eldar, <a href="/A366994/b366994.txt">Table of n, a(n) for n = 1..10000</a>
%F A366994 Multiplicative with a(p) = p and a(p^e) = p^A007917(e) for e >= 2.
%F A366994 a(n) <= n, with equality if and only if n is not in A322448.
%F A366994 Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/2) * Product_{p prime} f(1/p) = 0.48535795387619596052..., where f(x) = (1 - x) * (1 + Sum_{k>=1} x^(2*k-s(k))), s(k) = A007917(k) for k >= 2, and s(1) = 1.
%t A366994 f[p_, e_] := p^If[e == 1, 1, NextPrime[e+1, -1]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
%o A366994 (PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 2] == 1, f[i, 1], f[i, 1]^precprime(f[i, 2])));}
%Y A366994 Cf. A007917, A322448, A365683, A366989, A366991, A366992.
%K A366994 nonn,easy,mult
%O A366994 1,2
%A A366994 _Amiram Eldar_, Oct 31 2023