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

A249818 Permutation of natural numbers: a(1) = 1, a(n) = A246278(A055396(n),A078898(n)).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 27, 22, 23, 24, 25, 26, 21, 28, 29, 30, 31, 32, 45, 34, 35, 36, 37, 38, 33, 40, 41, 42, 43, 44, 81, 46, 47, 48, 49, 50, 75, 52, 53, 54, 125, 56, 63, 58, 59, 60, 61, 62, 39, 64, 55, 66, 67, 68, 135, 70, 71, 72, 73, 74, 51, 76, 77, 78, 79, 80, 99, 82, 83, 84, 175, 86, 105
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2014

Keywords

Comments

a(n) tells which number in square array A246278 is at the same position where n is in array A083221, the sieve of Eratosthenes. As both arrays have even numbers as their topmost row and primes as their leftmost column, both sequences are among the fixed points of this permutation.
Equally: a(n) tells which number in array A246279 is at the same position where n is in the array A083140, as they are the transposes of above two arrays.

Crossrefs

Inverse: A249817.
There are three different "deep" versions of this permutation, recursing on values of A055396(n) and/or A078898(n), namely: A250246, A250248 and A250250.
Other similar or related permutations: A249816.
Differs from its inverse A249817 for the first time at n=33, where a(33) = 45, while A249817(33) = 39.

Programs

  • Mathematica
    lim = 87; a003961[p_?PrimeQ] := a003961[p] = Prime[PrimePi@ p + 1]; a003961[1] = 1; a003961[n_] :=  a003961[n] = Times @@ (a003961[First@ #]^Last@ # &) /@ FactorInteger@ n; a055396[n_] := PrimePi[FactorInteger[n][[1, 1]]]; a078898 = Block[{nn = 90, spfs}, spfs = Table[FactorInteger[n][[1, 1]], {n, nn}]; Table[Count[Take[spfs, i], spfs[[i]]], {i, nn}]]; a246278 = NestList[Map[a003961, #] &, Table[2 k, {k, lim}], lim]; Table[a246278[[a055396@ n, a078898[[n]]]], {n, 2, lim}]
    (* Michael De Vlieger, Jan 04 2016, after Harvey P. Dale at A055396 and A078898 *)

Formula

a(1) = 1, a(n) = A246278(A055396(n), A078898(n)).
a(1) = 1, a(n) = A246278(A055396(n), A249822(A055396(n), A246277(n))).
As a composition of other permutations:
a(1) = 1, and for n > 1, a(n) = 1 + A249816(n-1).
Other identities. For all n >= 1:
a(A005843(n)) = A005843(n) and a(A000040(n)) = A000040(n). [Fixes even numbers and primes, among other numbers. Cf. comments above].
A020639(a(n)) = A020639(n) and A055396(a(n)) = A055396(n). [Preserves the smallest prime factor of n].

A250244 Permutation of natural numbers: a(n) = A249741(A055396(n+1), a(A246277(n+1))).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 26, 21, 22, 23, 24, 25, 20, 27, 28, 29, 30, 31, 38, 33, 34, 35, 36, 37, 62, 51, 40, 41, 42, 43, 32, 45, 46, 47, 48, 49, 74, 39, 52, 53, 64, 55, 98, 57, 58, 59, 60, 61, 56, 75, 94, 65, 66, 67, 110, 69, 70, 71, 72, 73, 50, 123, 76, 101, 78, 79, 44, 81, 82, 83, 154, 85, 134, 63, 88, 89
Offset: 1

Views

Author

Antti Karttunen, Nov 16 2014

Keywords

Comments

This is a "more recursed" variant of A249815. Preserves the parity of n.

Crossrefs

Inverse: A250243.
Similar or related permutations: A246683, A249814, A250245.
Differs from A249816 and A250243 for the first time at n=32, where a(32) = 38, while A249816(32) = A250243(32) = 44.
Differs from the "shallow variant" A249815 for the first time at n=39, where a(39) = 51, while A249815(39) = 39

Formula

a(n) = A249741(A055396(n+1), a(A246277(n+1))).
As a composition of other permutations:
a(n) = A249814(A246683(n)).
Other identities. For all n >= 1, the following holds:
a(n) = (1+a((2*n)-1)) / 2. [The odd bisection from a(1) onward with one added and then halved gives the sequence back.]
a(A006093(n)) = A006093(n). [Primes minus one are among the fixed points].

A249815 Permutation of natural numbers: a(n) = A249741(A055396(n+1), A246277(n+1)).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 26, 21, 22, 23, 24, 25, 20, 27, 28, 29, 30, 31, 38, 33, 34, 35, 36, 37, 62, 39, 40, 41, 42, 43, 32, 45, 46, 47, 48, 49, 74, 51, 52, 53, 64, 55, 98, 57, 58, 59, 60, 61, 56, 63, 94, 65, 66, 67, 110, 69, 70, 71, 72, 73, 50, 75, 76, 77, 78, 79, 44, 81, 82, 83
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2014

Keywords

Comments

a(n) tells which number in square array A249741 (the sieve of Eratosthenes minus 1) is at the same position where n is in array A246275. As the topmost row in both arrays is A005408 (odd numbers), they are fixed, i.e. a(2n+1) = 2n+1 for all n. Also, as the leftmost column in both arrays is primes minus one (A006093), they are also among the fixed points.
Equally: a(n) tells which number in array A114881 is at the same position where n is in the array A246273, as they are the transposes of above two arrays.

Crossrefs

Inverse: A249816
Similar or related permutations: A250244 ("deep variant"), A246675, A249811, A249817, A246273, A246275, A114881, A249741.
Differs from A249816 and A250243 for the first time at n=32, where a(32) = 38, while A249816(32) = A250243(32) = 44.
Differs from A250244 for the first time at n=39, where a(39) = 39, while A250244(39) = 51.

Programs

Formula

a(n) = A249741(A055396(n+1), A246277(n+1)).
As a composition of other permutations:
a(n) = A249811(A246675(n)).
a(n) = A249817(n+1) - 1.
Other identities. For all n >= 1:
a(A005408(n-1)) = A005408(n-1) and a(A006093(n)) = A006093(n). [Fixes odd numbers and precedents of primes. Cf. comments above].

A249812 Permutation of natural numbers: a(n) = A000079(A055396(n+1)-1) * ((2*A078898(n+1))-1).

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 7, 6, 9, 16, 11, 32, 13, 10, 15, 64, 17, 128, 19, 14, 21, 256, 23, 12, 25, 18, 27, 512, 29, 1024, 31, 22, 33, 20, 35, 2048, 37, 26, 39, 4096, 41, 8192, 43, 30, 45, 16384, 47, 24, 49, 34, 51, 32768, 53, 28, 55, 38, 57, 65536, 59, 131072, 61, 42, 63, 36, 65, 262144, 67, 46, 69, 524288, 71, 1048576, 73, 50, 75, 40, 77, 2097152, 79, 54, 81, 4194304, 83, 44
Offset: 1

Views

Author

Antti Karttunen, Nov 06 2014

Keywords

Comments

In the essence, a(n) tells which number in the array A135764 is at the same position where n is in the array A249741, the sieve of Eratosthenes minus 1. As the topmost row in both arrays is A005408 (odd numbers), they are fixed, i.e., a(2n+1) = 2n+1 for all n.
Equally: a(n) tells which number in array A054582 is at the same position where n is in the array A114881, as they are the transposes of above two arrays.

Crossrefs

Inverse: A249811.
Similar or related permutations: A249813 ("deep variant"), A246675, A249816, A054582, A114881, A250252, A135764, A249741, A249742.
Differs from A246675 for the first time at n=20, where a(20)=14, while A246675(20)=18.

Programs

Formula

a(n) = A000079(A055396(n+1)-1) * ((2*A078898(n+1))-1).
As a composition of related permutations:
a(n) = A054582(A250252(n)-1).
a(n) = A135764(A249742(n)).
a(n) = A246675(A249816(n)).
Other identities. For all n >= 1 the following holds:
a(A006093(n)) = A000079(n-1).

A250243 Permutation of natural numbers: a(n) = A246275(A055396(n+1), a(A078898(n+1))).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 26, 21, 22, 23, 24, 25, 20, 27, 28, 29, 30, 31, 44, 33, 34, 35, 36, 37, 32, 51, 40, 41, 42, 43, 80, 45, 46, 47, 48, 49, 74, 39, 52, 53, 124, 55, 62, 57, 58, 59, 60, 61, 38, 87, 54, 65, 66, 67, 134, 69, 70, 71, 72, 73, 50, 63, 76, 101, 78, 79, 98, 81
Offset: 1

Views

Author

Antti Karttunen, Nov 16 2014

Keywords

Comments

This is a "more recursed" variant of A249816. Preserves the parity of n.

Crossrefs

Inverse: A250244.
Similar or related permutations: A246684, A249813, A250246.
Differs from A249815 and A250244 for the first time at n=32, where a(32) = 44, while A249815(32) = A250244(32) = 38.
Differs from "shallow variant" A249816 for the first time at n=39, where a(39) = 51, while A249816(39) = 39.

Formula

a(n) = A246275(A055396(n+1), a(A078898(n+1))).
As a composition of other permutations:
a(n) = A246684(A249813(n)).
Other identities. For all n >= 1, the following holds:
a(n) = (1+a((2*n)-1))/2. [The odd bisection from a(1) onward with one added and then halved gives the sequence back.]
a(A006093(n)) = A006093(n). [Primes minus one are among the fixed points].
Showing 1-5 of 5 results.