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.

A379844 Squarefree numbers x such that the product of prime indices of x is a multiple of the sum of prime indices of x.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 30, 31, 37, 41, 43, 47, 53, 59, 61, 65, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 154, 157, 163, 165, 167, 173, 179, 181, 190, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241
Offset: 1

Views

Author

Gus Wiseman, Jan 19 2025

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. The sum and product of prime indices are A056239 and A003963 respectively.

Crossrefs

Squarefree case of A326149.
For nonprime instead of squarefree we have A326150.
The non-prime case is A326158.
Partitions of this type are counted by A379733, see A379735.
The even case is A379845, counted by A380221.
A003963 multiplies together prime indices.
A005117 lists the squarefree numbers.
A056239 adds up prime indices.
Counting and ranking multisets by comparing sum and product:
- same: A001055, ranks A301987
- divisible: A057567, ranks A326155
- divisor: A057568, ranks A326149
- greater than: A096276 shifted right, ranks A325038
- greater or equal: A096276, ranks A325044
- less than: A114324, ranks A325037, see A318029, A379720
- less or equal: A319005, ranks A379721, see A025147
- different: A379736, ranks A379722, see A111133

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[2,100],SquareFreeQ[#]&&Divisible[Times@@prix[#],Plus@@prix[#]]&]

Formula

Satisfies A056239(a(n))|A003963(a(n)).