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.

A235200 Self-inverse and multiplicative permutation of integers: a(0)=0, a(1)=1, a(2)=2, a(3)=5 and a(5)=3, a(p_i) = p_{a(i-1)+1} for primes with index i > 3, and a(u * v) = a(u) * a(v) for u, v > 0.

Original entry on oeis.org

0, 1, 2, 5, 4, 3, 10, 13, 8, 25, 6, 11, 20, 7, 26, 15, 16, 31, 50, 43, 12, 65, 22, 23, 40, 9, 14, 125, 52, 101, 30, 17, 32, 55, 62, 39, 100, 37, 86, 35, 24, 73, 130, 19, 44, 75, 46, 103, 80, 169, 18, 155, 28, 53, 250, 33, 104, 215, 202, 59, 60, 131, 34, 325, 64
Offset: 0

Views

Author

Antti Karttunen, Jan 04 2014

Keywords

Comments

The permutation satisfies A065091(a(n)) = a(A065091(n)) for all n >= 3, and is self-inverse: It swaps 3 & 5, maps all larger primes p_i (with index i > 3) to p_{a(i-1)+1}, and lets the multiplicativity take care of the rest.

Links

Crossrefs

List below gives similarly constructed permutations, which all force a swap of two small numbers, with the composite numbers defined by the multiplicative property and the fact that (the rest of) primes are permuted with the sequence itself. Apart from the first one, all satisfy A000040(a(n)) = a(A000040(n)) except for a finite number of cases (with A234840, substitute A008578 for A000040):
A234840 (swaps 2 & 3).
A235199 (swaps 5 & 7).
A235201 (swaps 3 & 4).
A235487 (swaps 7 & 8).
A235489 (swaps 8 & 9).
Cf. also A072029, A181351, A234743/A234744.

Formula

For n < 3, a(n)=n, a(3)=5 and a(5)=3, a(p_i) = p_{a(i-1)+1} for primes with index i > 3, and a(u * v) = a(u) * a(v) for u, v > 0.
A000035(a(n)) = A000035(n) = (n mod 2) for all n. [Even terms occur only on even indices and odd terms only on odd indices, respectively]

A072026 Swap twin prime pairs >(3,5) in prime factorization of n.

Original entry on oeis.org

1, 2, 3, 4, 7, 6, 5, 8, 9, 14, 13, 12, 11, 10, 21, 16, 19, 18, 17, 28, 15, 26, 23, 24, 49, 22, 27, 20, 31, 42, 29, 32, 39, 38, 35, 36, 37, 34, 33, 56, 43, 30, 41, 52, 63, 46, 47, 48, 25, 98, 57, 44, 53, 54, 91, 40, 51, 62, 61, 84, 59, 58, 45, 64, 77, 78
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 07 2002

Keywords

Examples

			a(143)=a(11*13)=a(11)*a(13)=13*11=143; a(77)=a(7*11)=a(7)*a(11)=5*13=65.

Links

Crossrefs

Cf. A007510, A037074, A072027, A001359, A006512, A072028, A072029, A061898, A064505.

Programs

  • Mathematica
    a[n_] := Product[{p, e} = pe; If[p <= 3, p, If[PrimeQ[p+2], p+2, If[PrimeQ[p-2], p-2, p]]]^e, {pe, FactorInteger[n]}];
Array[a, 100] (* Jean-François Alcover, Nov 20 2021 *)

Formula

a(a(n)) = n, a self-inverse permutation of natural numbers.
a(n) = n for single primes (A007510) and products of twin prime pairs (A037074).
Multiplicative with a(p) = (if p<=3 then p else (if p+2 is prime then p+2 else (if p-2 is prime then p-2 else p))), p prime.
Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/2) * Product_{p, q primes > 3, p = q+2} ((p^2-p)*(q^2-q)/((p^2-q)*(q^2-p))) = 0.53439004468579249988... . - Amiram Eldar, Dec 24 2022

A072027 Swap (2,3) and all twin prime pairs >(3,5) in prime factorization of n.

Original entry on oeis.org

1, 3, 2, 9, 7, 6, 5, 27, 4, 21, 13, 18, 11, 15, 14, 81, 19, 12, 17, 63, 10, 39, 23, 54, 49, 33, 8, 45, 31, 42, 29, 243, 26, 57, 35, 36, 37, 51, 22, 189, 43, 30, 41, 117, 28, 69, 47, 162, 25, 147, 38, 99, 53, 24, 91, 135, 34, 93, 61, 126, 59, 87, 20, 729, 77
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 07 2002

Keywords

Examples

			a(143) = a(11*13) = a(11)*a(13) = 13*11 = 143.
a(77) = a(7*11) = a(7)*a(11) = 5*13 = 65.

Links

Crossrefs

Cf. A001359, A006512, A007510, A037074, A061898, A064505, A072026, A072028, A072029.

Programs

  • Mathematica
    f[p_, e_] := If[p < 5, 5 - p, If[PrimeQ[p + 2], p + 2, If[PrimeQ[p - 2], p - 2, p]]]^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Feb 26 2024 *)
  • PARI
    a(n) = {my(f = factor(n)); prod(i = 1, #f~, p = f[i,1]; if(p < 5, 5-p, if(isprime(p+2), p+2, if(isprime(p-2), p-2, p)))^f[i,2]);} \\ Amiram Eldar, Feb 26 2024

Formula

Multiplicative with a(p) = (if p<=3 then 5-p else (if p+2 is prime then p+2 else (if p-2 is prime then p-2 else p))), p prime.
a(a(n)) = n, self-inverse permutation of natural numbers.
a(n) = n for single primes (A007510) and products of twin prime pairs (A037074).
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = Product_{(p < q) swapped pair} ((p^2-p)*(q^2-q)/((p^2-q)*(q^2-p))) = 1.832194438922717... . - Amiram Eldar, Feb 26 2024

A072028 Swap twin prime pairs of form (4*k+1,4*k+3) in prime factorization of n.

Original entry on oeis.org

1, 2, 3, 4, 7, 6, 5, 8, 9, 14, 11, 12, 13, 10, 21, 16, 19, 18, 17, 28, 15, 22, 23, 24, 49, 26, 27, 20, 31, 42, 29, 32, 33, 38, 35, 36, 37, 34, 39, 56, 43, 30, 41, 44, 63, 46, 47, 48, 25, 98, 57, 52, 53, 54, 77, 40, 51, 62, 59, 84, 61, 58, 45, 64, 91, 66
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 07 2002

Keywords

Examples

			a(65) = a(5*13) = a(5)*a(13) = a(4*1+1)*a(13) = (4*1+3)*13 = 7*13 = 91.

Links

Crossrefs

Cf. A061898, A064505, A071695, A071696, A072026, A072027, A072029.

Programs

  • Mathematica
    f[p_, e_] := If[p < 5, p, If[(m = Mod[p, 4]) == 1 && PrimeQ[p + 2], p + 2, If[m == 3 && PrimeQ[p - 2], p - 2, p]]]^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Feb 26 2024 *)
  • PARI
    a(n) = {my(f = factor(n)); prod(i = 1, #f~, p = f[i,1]; if(p < 5, p, if(p%4 == 1 && isprime(p+2), p+2, if(p%4 == 3 && isprime(p-2), p-2, p)))^f[i,2]);} \\ Amiram Eldar, Feb 26 2024

Formula

Multiplicative with a(p) = (if p mod 4 = 1 and p+2 is prime then p+2 else (if p mod 4 = 3 and p-2 is prime then p-2 else p)), p prime.
a(a(n)) = n, a self-inverse permutation of natural numbers.
Sum_{k=1..n} a(k) ~ c * n^2 / 2, where c = Product_{(p < q) swapped pair} ((p^2-p)*(q^2-q)/((p^2-q)*(q^2-p))) = 1.0627249749498993391... . - Amiram Eldar, Feb 26 2024
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.