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.

Showing 1-3 of 3 results.

A048977 Primes arising in A048969.

Original entry on oeis.org

3, 7, 13, 19, 31, 61, 127, 127, 331, 307, 307, 631, 1801, 1723, 3169, 1093, 1723, 3571, 1093, 3221, 5419, 3541, 3541, 8269, 5113, 5113, 13267, 8011, 8011, 16651, 10303, 19441, 10303, 24571, 17293, 17293, 28057, 30103, 55897, 28057, 59221, 30103, 8191, 19531
Offset: 1

Views

Author

G. L. Honaker, Jr.

Keywords

Crossrefs

Cf. A048968, A048969.

Programs

  • Mathematica
    p[n_]:=Module[{c=DivisorSigma[1,n]/DivisorSigma[0,n]},If[PrimeQ[c],c,0]]; nn=62000;With[{comps=Complement[Range[nn],Prime[Range[PrimePi[nn]]]]}, Select[ p/@comps,#!=0&]] (* Harvey P. Dale, Feb 19 2012 *)

Extensions

More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Jun 17 2001
More terms from Sean A. Irvine, Jul 16 2021

A048968 Numbers k such that sigma(k) / d(k) is prime.

Original entry on oeis.org

3, 5, 6, 13, 20, 37, 45, 49, 61, 73, 150, 157, 169, 193, 277, 313, 361, 397, 421, 457, 541, 613, 661, 673, 733, 757, 832, 877, 961, 997, 1093, 1153, 1201, 1213, 1237, 1321, 1381, 1445, 1453, 1621, 1657, 1734, 1753, 1849, 1873, 1933, 1993, 2017, 2137, 2341
Offset: 1

Views

Author

G. L. Honaker, Jr.

Keywords

Comments

Union of A005383 and A048969.

Links

Crossrefs

Cf. A000203, A000005, A005383, A048969.

Programs

  • Maple
    with(numtheory); A048968:=n->`if`(type(sigma(n)/tau(n), prime), n, NULL); seq(A048968(n), n=1..2400); # Wesley Ivan Hurt, Feb 04 2014
  • Mathematica
    Select[ Range[2400], PrimeQ[ DivisorSigma[1, #] / DivisorSigma[0, #] ]& ] (* Jean-François Alcover, Sep 24 2012 *)
  • PARI
    isok(k) = {my(f = factor(k), d = numdiv(f), s = sigma(f)); !(s % d) && isprime(s / d);} \\ Amiram Eldar, Jan 13 2025

Extensions

More terms from Jud McCranie

A089765 Composite n whose sum of distinct divisors, s(d), ignoring divisors n and 1, divided by the count of divisors (not counting n and 1), c(d), are primes. Duplicate divisors, as in 2*2=4 are counted just once.

Original entry on oeis.org

4, 8, 9, 18, 21, 25, 33, 49, 57, 69, 81, 85, 93, 121, 129, 133, 145, 169, 177, 205, 213, 217, 237, 249, 253, 265, 273, 289, 309, 361, 393, 417, 445, 469, 489, 493, 505, 517, 529, 553, 565, 573, 597, 633, 669, 685, 697, 753, 777, 781, 793, 813, 817, 841, 865
Offset: 1

Views

Author

Enoch Haga, Jan 09 2004

Keywords

Examples

			a(1)= 8 because its factors are 8, 1, 2, 4. Ignoring 8 and 1, the sum of 2+4=6. The count of factors is 2 and 6/2=3, a prime.

References

  • Glenn James and Robert C. James, Mathematics Dictionary, Princeton, N.J.: D. Van Nostrand Co., Inc., 1959; page 154 (factor of an integer).

Links

Crossrefs

Cf. A002808, A048968, A048969.

Programs

  • Mathematica
    aQ[n_] := CompositeQ[n] && PrimeQ[(DivisorSigma[1, n] - n - 1)/(DivisorSigma[0, n] - 2)]; Select[Range[865], aQ] (* Amiram Eldar, Sep 07 2019 *)

Formula

Factor n into its distinct divisors, ignore n and 1, add the divisors and divide by the number of divisors. If s(d) / c(d) [sum divided by count] is prime, add to sequence.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.