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-4 of 4 results.

A255423 The least number k > A255334(n) for which A000203(k) = A000203(A255334(n)) and A007947(k) = A007947(A255334(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, 59682, 52728, 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, 269598, 281946, 286062, 294294
Offset: 1

Views

Author

Antti Karttunen, Apr 06 2015

Keywords

Links

Crossrefs

Cf. A000203, A007947, A255334.
Cf. also A255335 (same sequence sorted into ascending order), A255424 (squarefree kernel of a(n)), A255426 (same terms with but with their squarefree kernel divided out of them).

Programs

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

Formula

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

A255424 Squarefree kernel of A255334: a(n) = A007947(A255334(n)).

Original entry on oeis.org

42, 210, 462, 546, 714, 798, 966, 210, 1218, 78, 1302, 1554, 1722, 1806, 1974, 2226, 2310, 2478, 2562, 2730, 2814, 2982, 3066, 3318, 3486, 3570, 3738, 3990, 4074, 4242, 4326, 4494, 4578, 4746, 4830, 462, 210, 5334, 5502, 5754, 5838, 6006, 6090, 390, 6258, 6342, 6510, 6594, 6846, 7014, 546, 7266, 7518, 7602, 7770, 7854, 8022, 8106, 8274, 8358, 8610
Offset: 1

Views

Author

Antti Karttunen, Apr 06 2015

Keywords

Comments

Sequence gives value of A007947(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 according to the magnitude of n, and contains duplicates, because there are cases of multiple such pairs having same squarefree kernel.
The first duplicate occurs as a(2) = a(8) = 210.

Links

Crossrefs

Cf. A007947, A255334, A255412, A255423, A255425, A255426.

Programs

Formula

a(n) = A007947(A255334(n)).
a(n) = A007947(A255423(n)). [Equally, squarefree kernel of A255423(n).]

A255425 a(n) = A003557(A255334(n)) = A255334(n) / A255424(n).

Original entry on oeis.org

36, 36, 36, 36, 36, 36, 36, 180, 36, 576, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 396, 900, 36, 36, 36, 36, 36, 36, 576, 36, 36, 36, 36, 36, 36, 468, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 576, 36, 36
Offset: 1

Views

Author

Antti Karttunen, Apr 06 2015

Keywords

Links

Crossrefs

Cf. A003557, A254791, A255334, A255424, A255426.

Formula

a(n) = A003557(A255334(n)) = A255334(n) / A255424(n).
For all n, a(n) > 1 and a(n) < A255426(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

Views

Author

Fred Schneider, Feb 07 2015

Keywords

Comments

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.

Examples

			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.

Crossrefs

Cf. A000203, A007947.
Subsequence of A254035. Cf. also A255334, A255425, A255426.
Showing 1-4 of 4 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.