login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232241 Composites where the greatest prime factor is the sum of the other prime powers. 1
4, 9, 25, 30, 49, 70, 84, 121, 169, 198, 264, 286, 289, 308, 361, 468, 520, 529, 646, 841, 884, 912, 961, 1224, 1369, 1566, 1672, 1681, 1748, 1798, 1849, 2209, 2576, 2809, 2900, 3135, 3348, 3481, 3526, 3570, 3721, 4489, 5041, 5329, 5704, 5920, 6032 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
This is the sequence of positive integers that can be expressed as the product of prime powers, multiplied by the sum of the same prime powers. And the sum of the prime powers is also the greatest prime factor of the composite number.
I.e., there is a solution for n=(p1^i1*p2^i2*p3^i3...)*(p1^i1+p2^i2+pi3^i3...); where p1, p2, p3, etc. are distinct primes; and i1, i2, i3, etc. are the corresponding positive exponents.
The additional constraint is that the sum of the prime powers must also be the greatest prime factor (gpf) of n.
This sequence also contains the square of every prime number.
LINKS
EXAMPLE
9 is in the sequence since prod(3^1)*sum(3^1)=(3^1)*(3^1)=3*3=9, and the gpf, 3 is prime.
1224 is in the sequence since (2^3*3^2)*(2^3+3^2)=(8*9)*(8+9)=72*17=1224, and the gpf, 17 is prime.
6032 is in the sequence since (2^4*13^1)*(2^4+13^1)=(16*13)*(16+13)=208*29=6032, and the gpf, 29 is prime.
MATHEMATICA
seqQ[n_] := Module[{f = FactorInteger[n]}, If[Length[f] == 1, f[[1, 2]] == 2, f[[-1, 2]] == 1 && f[[-1, 1]] == Plus @@ Power @@@ Most[f]]]; Select[Range[6000], seqQ] (* Amiram Eldar, Apr 28 2020 *)
PROG
(Java) public class Psfi {public static void main(String[] args) {String sequence = ""; for (int n = 2; sequence.length() < 250; n++) {int q = n; int s = 0; for (int d = 2; d <= Math.sqrt(q); d++) {int i = 0; while (q > d && q % d == 0) {i++; q = q / d; } if (i > 0) {s += Math.pow(d, i); } } if (s == q) {sequence += n + ", "; } } System.out.println(sequence); } }
(PARI) isok(n) = {if (n>1, my(fa = factor(n), gpf = fa[#fa~, 1], fb = factor(n/gpf)); gpf == sum(i=1, #fb~, fb[i, 1]^fb[i, 2])); } \\ Michel Marcus, Nov 21 2013; Apr 28 2020
CROSSREFS
Variant of A163836.
Sequence in context: A045967 A373410 A336445 * A163836 A175085 A182120
KEYWORD
nonn,easy
AUTHOR
John R Phelan, Nov 20 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 23 09:29 EDT 2024. Contains 373629 sequences. (Running on oeis4.)