A254035 -id:A254035 - cp's OEIS frontend

A255334 Numbers n for which there exists k > n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.

1512, 7560, 16632, 19656, 25704, 28728, 34776, 37800, 43848, 44928, 46872, 55944, 61992, 65016, 71064, 80136, 83160, 89208, 92232, 98280, 101304, 107352, 110376, 119448, 125496, 128520, 134568, 143640, 146664, 152712, 155736, 161784, 164808, 170856, 173880, 182952, 189000, 192024, 198072, 207144, 210168, 216216

Offset: 1

Antti Karttunen, Mar 23 2015

nonn

None of the terms are squarefree, because if there were such x, then we would have rad(x) = x, and for any value k > x such that rad(k) = x we would have k = y*x, for some strictly positive integer y, and in that case sigma(k) > sigma(x). Thus all terms are members of sequence A013929.

None of the terms in range a(1) .. a(6589) occur in A255335. Are the sequences disjoint forever?

Antti Karttunen, Table of n, a(n) for n = 1..6589

Subsequence of A013929.
Cf. A000203, A007947.
Cf. also A255423 (gives the corresponding k), A255335 (same sequence sorted into ascending order, with duplicates removed), A255412 [gives sigma(a(n))], A255424 [gives rad(a(n))], A255425, A254035, A254791.

A007947(n) = factorback(factorint(n)[, 1]); \\ Andrew Lelechenko, May 09 2014
isA255334(n) = { my(r=A007947(n), s=sigma(n), k=n+r); while(kA007947(k) == r), return(1), k = k+r)); return(0); };
i=0; for(n=1, 2^25, if(isA255334(n), i++; write("b255334.txt", i, " ", n)))

;; With Antti Karttunen's IntSeq-library. Quite naive and slow implementation.
(define A255334 (MATCHING-POS 1 1 isA255334?))
(define (isA255334? n) (let ((sig_n (A000203 n)) (rad_n (A007947 n))) (let loop ((try (+ n rad_n))) (cond ((>= try sig_n) #f) ((and (= sig_n (A000203 try)) (= rad_n (A007947 try))) #t) (else (loop (+ try rad_n)))))))

a(n) = A255424(n) * A255425(n).

A254791 Nontrivial solutions to n = sigma(a) = sigma(b) (A000203) and rad(a) = rad(b) (A007947) with a != b.

Original entry on oeis.org

4800, 142800, 1909440, 32948784, 210313800, 993938400, 1069286400, 1264808160, 1309463064, 2281635216, 3055104000, 3250790400

Offset: 1

Fred Schneider, Feb 07 2015

nonn

On the term "nontrivial":
If a !=b, sigma(a) = sigma(b) and rad(a) = rad(b) then sigma(a*x) = sigma(b*x) and rad(n*x) = rad(m*x) when gcd(a, b) = gcd(a,x) = gcd(b,x) = 1. So each general solution to the stated problem could generate an infinitude of constructed, "trivial" solutions. So we will limit ourselves to the more interesting "nontrivial" solutions. Precisely, if rad(a) = rad(b) = Product(p(i)), we can write a = Product(p(i)^a(i)), b = Product(p(i)^b(i)) and in this context, a(i) != b(i) for each i in order to have a nontrivial solution.
There is another type of trivial solution, if n can be expressed as the product of two or more smaller solutions, it would be considered a composite solution but still trivial.
The smallest composite solution is below:
210313800: 131576362 = 2 * 17 * 157^3 and 98731648 = 2^7 * 17^3 * 1573250790400: 2196937295 = 5 * 7^3 * 31^3 * 43 and 2156627375 = 5^3 * 7 * 31 * 43^3. Note: the common rads for the two pairs have no factors in common so we have these "trivial" composite solutions below.
sigma(131576362 * 2196937295) = sigma(98731648 * 2156627375) = sigma(131576362 * 2156627375) = sigma(98731648 * 2196937295) = 683686082027520000.

			Sigma => Pair of distinct integers 4800 => 2058 = 2 * 3 * 7^3 and 1512 = 2^3 * 3^3 * 7142800 => 52728 = 2^3 * 3 * 13^3 and 44928 = 2^7 * 3^3 * 131909440 => 1038230 = 2 * 5 * 47^3 and 752000 = 2^7 * 5^3 * 4732948784 => 10825650 = 2 * 3^9 * 5^2 * 11 and 8624880 = 2^4 * 3^4 * 5 * 11^3210313800 => 131576362 = 2 * 17 * 157^3 and 98731648 = 2^7 * 17^3 * 157993938400 => 336110688 = 2^5 * 3^3 * 73^3 and 326965248 = 2^11 * 3^7 * 73.
The pairs that contribute to the solution each have the same rad or squarefree kernel and they are "nontrivial" because within a pair for the same prime, none of the exponents match.

Cf. A000203, A007947.

Subsequence of A254035. Cf. also A255334, A255425, A255426.

A255335 Numbers n for which there exists k < n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.

Original entry on oeis.org

2058, 10290, 22638, 26754, 34986, 39102, 47334, 51450, 52728, 59682, 63798, 76146, 84378, 88494, 96726, 109074, 113190, 121422, 125538, 133770, 137886, 146118, 150234, 162582, 170814, 174930, 183162, 195510, 199626, 207858, 211974, 220206, 224322, 232554, 236670, 249018, 257250, 261366, 263640, 269598, 281946, 286062, 294294

Offset: 1

Antti Karttunen, Mar 23 2015, suggested by Michel Marcus, Feb 23 2015

nonn

Sequence A255423 sorted into ascending order.
Note that both for u = a(17) = 113190 and v = a(22) = 146118, A000203(u) = A000203(v) = 345600.
Also, both for w = a(20) = 133770 and x = a(25) = 170814, A000203(w) = A000203(x) = 403200.
Question: Does this have any common terms with A255334 ?

Antti Karttunen, Table of n, a(n) for n = 1..2434

Subsequence of A013929.
Cf. A000203, A007947.
Cf. also A255334, A255423, A254035.

allocatemem(234567890);
A007947(n) = factorback(factorint(n)[, 1]); \\ Andrew Lelechenko, May 09 2014
upto = (2^24)-4;
bigvec = vector(upto);
i=0; for(n=1, upto, bigvec[n] = Set([]); my(r=A007947(n), s=sigma(n)); if(setsearch(bigvec[r],s), i++; write("b255335.txt", i, " ", n), bigvec[r] = setunion(Set([s]),bigvec[r])));

;; With Antti Karttunen's IntSeq-library. Quite naive implementation.
(define A255335 (MATCHING-POS 1 1 isA255335?))
(define (isA255335? n) (let ((sig_n (A000203 n)) (rad_n (A007947 n))) (let loop ((try (- n rad_n))) (cond ((< try rad_n) #f) ((and (= sig_n (A000203 try)) (= rad_n (A007947 try))) #t) (else (loop (- try rad_n)))))))

A255412 a(n) = A000203(A255334(n)).

Original entry on oeis.org

4800, 28800, 57600, 67200, 86400, 96000, 115200, 148800, 144000, 142800, 153600, 182400, 201600, 211200, 230400, 259200, 345600, 288000, 297600, 403200, 326400, 345600, 355200, 384000, 403200, 518400, 432000, 576000, 470400, 489600, 499200, 518400, 528000, 547200, 691200, 638400, 748800, 614400, 633600, 662400, 672000, 806400, 864000, 856800, 720000

Offset: 1

Antti Karttunen, Apr 05 2015

nonn

Sequence gives value of sigma(n) for numbers n for which there exists k > n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n. The sequence is ordered by the magnitude of n, and contains duplicates, because there are cases of multiple such pairs having the same value of sigma.

The first such duplicate values occur as a(17) = a(22) = 345600 and a(20) = a(25) = 403200.

Antti Karttunen, Table of n, a(n) for n = 1..6589

Cf. A254035 (same sequence sorted into ascending order, with duplicates removed).

Cf. A000203, A007947, A255334, A255423, A255424.

(define (A255412 n) (A000203 (A255334 n)))

a(n) = A000203(A255334(n)).

a(n) = A000203(A255423(n)).

A252997 Numbers n such that sigma(x) - x = n has at least two solutions, with each x having the same squarefree kernel, where sigma(x) is the sum of divisor function (A000203).

Original entry on oeis.org

218, 189648, 720240, 119967120, 129705984, 517941905, 707902440, 1321744320, 98890370304, 99080219520, 119922568640, 139834382688, 347612467648, 580542318720, 952717920000, 1064902900320, 1153644808680, 2255573174400, 3903820736256, 6859688278905, 10944640212480, 14424196864000

Offset: 1

Naohiro Nomoto, Dec 25 2014

nonn

Numbers n such that n = A001065(j) = A001065(k) and A007947(j) = A007947(k), where j != k.

			218 is the sum of proper divisors of 250 and 160, and rad(250) = rad(160) = 10, hence 218 is in the sequence with j=250 and k=160.
Other examples of n and j, k:
For n = 189648, j = 95832, k = 85536.
For n = 720240, j = 288120, k = 246960.
For n = 119967120, j = 38755080, k = 34398000.
For n = 129705984, j = 71614464, k = 60424704.

Carlos Rivera, Prime Puzzle 774. S(i) and Rad(i), The Prime Puzzles and Problems Connection.

Cf. A001065 (sum of proper divisors of n), A007947 (squarefree kernel of n).

Cf. A048138, A152454, A254035.

a(6) onward from Fred Schneider, Feb 07 2015

cp's OEIS Frontend

A255334 Numbers n for which there exists k > n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Scheme

Formula

A254791 Nontrivial solutions to n = sigma(a) = sigma(b) (A000203) and rad(a) = rad(b) (A007947) with a != b.

Views

Author

Keywords

Comments

Examples

Crossrefs

A255335 Numbers n for which there exists k < n such that A000203(k) = A000203(n) and A007947(k) = A007947(n), where A000203 gives the sum of divisors, and A007947 gives the squarefree kernel of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Scheme

A255412 a(n) = A000203(A255334(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A252997 Numbers n such that sigma(x) - x = n has at least two solutions, with each x having the same squarefree kernel, where sigma(x) is the sum of divisor function (A000203).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions