cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A339936 Odd coreful abundant numbers: the odd terms of A308053.

This page as a plain text file.
%I A339936 #13 Sep 02 2022 11:58:11
%S A339936 99225,165375,231525,297675,496125,694575,826875,893025,1091475,
%T A339936 1157625,1225125,1289925,1488375,1620675,1686825,1819125,1885275,
%U A339936 2083725,2149875,2282175,2480625,2546775,2679075,2811375,2877525,3009825,3075975,3142125,3274425,3472875
%N A339936 Odd coreful abundant numbers: the odd terms of A308053.
%C A339936 The asymptotic density of this sequence is Sum_{n>=1} f(A356871(n)) = 9.1348...*10^(-6), where f(n) = (4/(Pi^2*n))*Product_{prime p|n}(p/(p+1)) if n is odd and 0 otherwise. - _Amiram Eldar_, Sep 02 2022
%H A339936 Amiram Eldar, <a href="/A339936/b339936.txt">Table of n, a(n) for n = 1..10000</a>
%e A339936 99225 is a term since it is odd and the sum of its coreful divisors is A057723(99225) = 201600 > 2 * 99225.
%t A339936 f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 1; s[n_] := Times @@ (f @@@ FactorInteger[n]); Select[Range[1, 10^6, 2], s[#] > 2*# &]
%Y A339936 Intersection of A005408 and A308053.
%Y A339936 Subsequence of A321147.
%Y A339936 Cf. A057723, A356871.
%Y A339936 Similar sequences: A005231, A094889, A112643, A127666, A129485, A293186, A321147, A333950.
%K A339936 nonn
%O A339936 1,1
%A A339936 _Amiram Eldar_, Dec 23 2020