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.

Previous Showing 21-25 of 25 results.

A245613 Permutation of natural numbers: a(1) = 1; thereafter, if n is k-th number with an odd number of prime divisors (counted with multiplicity) [i.e., n = A026424(k)], a(n) = A244991(a(k)), otherwise, when n is k-th number > 1 with an even number of prime divisors [i.e., n = A028260(1+k)], a(n) = A244990(1+a(k)).

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 5, 16, 9, 7, 11, 10, 32, 18, 13, 12, 17, 15, 22, 20, 35, 19, 66, 14, 24, 21, 34, 25, 23, 33, 31, 45, 63, 37, 27, 26, 41, 36, 29, 43, 69, 40, 134, 30, 47, 39, 44, 68, 71, 50, 38, 46, 67, 131, 28, 49, 42, 70, 64, 52, 92, 48, 127, 65, 61, 75, 55, 51, 89, 83, 73, 60
Offset: 1

Views

Author

Antti Karttunen, Jul 27 2014

Keywords

Comments

This shares with the permutation A122111 the property that each term of A028260 is mapped to a unique term of A244990 and each term of A026424 is mapped to a unique term of A244991.

Crossrefs

Formula

a(1) = 1, and for n > 1, if A066829(n) = 1, a(n) = A244991(a(A055038(n))), otherwise a(n) = A244990(1+a(A055037(n)-1)).
As a composition of related permutations:
a(n) = A244322(A245603(n)).
For all n >= 1, A066829(n) = A244992(a(n)).

A252757 Permutation of natural numbers: a(1)=1, and for n>1, if n is k-th number whose largest prime factor is less than the square of its smallest prime factor [i.e., n = A251726(k)], a(n) = 2*a(k), otherwise, when n = A251727(k), a(n) = 1 + 2*a(k).

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 256, 3, 512, 6, 1024, 5, 12, 2048, 10, 24, 4096, 9, 20, 17, 48, 8192, 18, 33, 40, 65, 34, 129, 96, 16384, 257, 513, 36, 66, 80, 7, 1025, 13, 130, 2049, 68, 11, 258, 25, 192, 32768, 514, 4097, 21, 49, 1026, 72, 132, 8193, 19, 41, 160, 35, 14, 97, 2050, 26, 260, 16385, 4098, 37, 67, 81, 136, 22
Offset: 1

Views

Author

Antti Karttunen, Jan 02 2015

Keywords

Crossrefs

Inverse: A252758.
Similar permutations: A243287, A135141, A237427.

Formula

a(1)=1, and for n>1: if A252372(n) = 1 [i.e. the largest prime factor of n is less than the square of its smallest prime factor], a(n) = 2*a(A252373(k)), otherwise, a(n) = 1 + 2*a(n-A252373(n)-1).

A266638 a(1) = 1, a(ludic(n)) = (ludic(3+a(n-1))-1)/2, a(nonludic(n)) = A266410(a(n)), where ludic(n) = n-th ludic number A003309, nonludic(n) = n-th nonludic number A192607 and A266410 = numbers n such that 2n+1 is nonludic.

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 6, 9, 10, 13, 8, 16, 12, 15, 19, 22, 11, 27, 17, 31, 25, 29, 18, 36, 20, 40, 24, 49, 26, 32, 54, 46, 51, 34, 62, 37, 14, 68, 43, 81, 35, 47, 23, 55, 88, 76, 33, 83, 58, 99, 64, 28, 44, 107, 72, 127, 61, 77, 42, 91, 53, 136, 121, 56, 130, 94, 21, 151, 101, 50, 65, 73, 161, 114, 189, 98, 38
Offset: 1

Views

Author

Antti Karttunen, Jan 28 2016

Keywords

Crossrefs

Inverse: A266637.
Related or similar permutations: A237427, A266418.

Formula

a(1) = 1; for n > 1, if A192490(n) = 1 [when n is one of Ludic numbers, A003309] a(n) = A266409(1+a(A192512(n)-1)), otherwise a(n) = A266410(a(A236863(n))).
As a composition of related permutations:
a(n) = A266418(A237427(n)).

A257733 Permutation of natural numbers: a(1) = 1, a(ludic(n)) = lucky(1+a(n-1)), a(nonludic(n)) = unlucky(a(n)), where ludic(n) = n-th ludic number A003309, nonludic(n) = n-th nonludic number A192607 and lucky = A000959, unlucky = A050505.

Original entry on oeis.org

1, 3, 9, 2, 33, 5, 7, 14, 4, 45, 163, 8, 15, 11, 20, 6, 25, 59, 203, 12, 22, 17, 63, 28, 13, 10, 35, 78, 235, 251, 18, 30, 24, 83, 39, 19, 1093, 16, 47, 101, 31, 290, 67, 309, 26, 41, 43, 34, 107, 53, 27, 1283, 87, 23, 61, 128, 42, 354, 88, 376, 21, 36, 55, 57, 46, 137, 115, 70, 38, 1499, 321, 112, 32, 81, 161, 56, 1401, 430, 113, 454, 29, 48, 49
Offset: 1

Views

Author

Antti Karttunen, May 06 2015

Keywords

Crossrefs

Inverse: A257734.
Related or similar permutations: A237427, A255422, A257726, A257731.
Cf. also A256486, A256487.
Differs from A257731 for the first time at n=19, where a(19) = 203, while A257731(19) = 63.

Formula

a(1) = 1; for n > 1: if A192490(n) = 1 [i.e., if n is ludic], then a(n) = A000959(1+a(A192512(n)-1)), otherwise a(n) = A050505(a(A236863(n))).
As a composition of other permutations:
a(n) = A257731(A255422(n)).
a(n) = A257726(A237427(n)).

A266417 a(1) = 1; for n > 1, if A192490(2n+1) = 1 [when 2n+1 is Ludic number] a(n) = 1 + 2*a(A266350(n)-1), otherwise a(n) = 2*a(n-A266350(n)).

Original entry on oeis.org

1, 3, 7, 2, 15, 5, 6, 31, 14, 4, 11, 13, 30, 63, 10, 12, 62, 29, 28, 9, 23, 8, 27, 22, 26, 61, 60, 126, 20, 127, 24, 124, 21, 58, 25, 56, 18, 125, 46, 16, 59, 54, 44, 57, 19, 52, 122, 47, 120, 252, 40, 254, 17, 48, 248, 42, 55, 116, 45, 53, 50, 112, 123, 36, 121, 250, 92, 32, 118, 108, 253, 88, 114, 41, 38
Offset: 1

Views

Author

Antti Karttunen, Jan 28 2016

Keywords

Crossrefs

Inverse: A266418.
Similar or related permutations: A237427, A266637.

Formula

a(1) = 1; for n > 1, if A192490(2*n + 1) = 1 [when 2n+1 is Ludic number] a(n) = 1 + 2*a(A266350(n)-1), otherwise a(n) = 2*a(n-A266350(n)).
As a composition of related permutations:
a(n) = A237427(A266637(n)).
Previous Showing 21-25 of 25 results.