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.

A075657 Numbers n such that sum of digits (A007953) is a divisor of sum of prime divisors (A008472).

Original entry on oeis.org

2, 3, 5, 7, 10, 42, 70, 84, 91, 100, 104, 110, 114, 115, 130, 143, 148, 154, 160, 170, 182, 185, 212, 215, 221, 222, 228, 230, 234, 238, 250, 266, 295, 304, 312, 326, 336, 372, 402, 412, 425, 437, 460, 468, 485, 494, 516, 555, 558, 583, 700, 702, 721, 730
Offset: 1

Views

Author

Floor van Lamoen, Sep 23 2002 and Sep 30 2002

Keywords

Examples

			digsum(10) = 1 + 0 = 1, PrimeDivisors(10) = PrimeDivisors(2 *5) = {2,5} and sopf(10) = 2 + 5 = 7 = 7*1.
digsum(154) = 1 + 5 + 4 = 10, PrimeDivisors(154) = PrimeDivisors(2 * 7 * 11) = {2,7,11} and sopf(154) = 2+7+11 = 20 = 2*10.
		

Programs

  • Magma
    [m:m in [2..730]| &+PrimeDivisors(m) mod &+Intseq(m) eq 0]; // Marius A. Burtea, Jul 11 2019
  • Mathematica
    Select[Range[2,800],Divisible[Total[Select[Divisors[#],PrimeQ]], Total[ IntegerDigits[#]]]&] (* Harvey P. Dale, Sep 23 2012 *)