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.

A303933 a(n) is the number of odd primitive abundant numbers with n distinct prime divisors.

This page as a plain text file.
%I A303933 #27 Oct 18 2018 10:24:21
%S A303933 0,0,8,576,3913172
%N A303933 a(n) is the number of odd primitive abundant numbers with n distinct prime divisors.
%C A303933 The 6th term is possibly 59687996404445, but this is at present unverified. - _Jacob Liddy_, Oct 16 2018
%D A303933 Valdas Diciunas, On the number of odd primitive abundant numbers with five and six distinct prime factors, Vilnius Conference in Combinatorics and Number Theory, page 12, 2017.
%H A303933 Valdas Diciunas, <a href="https://klevas.mif.vu.lt/~valdas/Abundant_Numbers/Abundant.pdf">On the number of odd primitive abundant numbers with five and six distinct prime factors</a>, slides, 2017.
%H A303933 L. E. Dickson, <a href="http://www.jstor.org/stable/2370405">Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors</a>, American Journal of Mathematics 35 (1913), pp. 413-422.
%H A303933 Jacob Liddy, <a href="http://www.math.uakron.edu/~sf34/opans0_6.html">OPANS (Odd Primitive Abundant NumberS)</a>, 2018. The downloadable file is a Zip-archive, 640 Megabytes, uncompresses to 10 Gigabytes.
%Y A303933 Cf. A005231 (odd abundant), A006038 (odd primitive abundant).
%Y A303933 Row lengths of A188439.
%K A303933 hard,more,nonn
%O A303933 1,3
%A A303933 _Jacob Liddy_, May 02 2018