A269382 -id:A269382 - cp's OEIS frontend

A269379 a(1) = 1; for n > 1, a(n) = A255127(A260738(n)+1, A260739(n)).

1, 3, 5, 9, 7, 15, 11, 21, 19, 27, 13, 33, 17, 39, 35, 45, 23, 51, 31, 57, 49, 63, 25, 69, 29, 75, 65, 81, 37, 87, 55, 93, 79, 99, 59, 105, 41, 111, 95, 117, 43, 123, 47, 129, 109, 135, 53, 141, 85, 147, 125, 153, 61, 159, 73, 165, 139, 171, 103, 177, 67, 183, 155, 189, 113, 195, 71, 201, 169, 207, 77, 213, 101, 219, 185, 225, 83

Offset: 1

Antti Karttunen, Mar 01 2016

nonn

a(n) = the number located immediately below n in A255127 (square array generated by Ludic sieve) in the same column where n itself is, or in other words, the number removed in the next filtering stage at the same step as when n was removed in the A260738(n)-th stage.

Permutation of odd numbers.

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

Cf. A255127, A260738, A260739.
Cf. A269171, A269356, A269358, A269382, A269385, A269387 (sequences that use this function).
Cf. A269380 (left inverse).
Cf. also A250469, A269369.

(define (A269379 n) (if (= 1 n) n (A255127bi (+ (A260738 n) 1) (A260739 n)))) ;; Code for A255127bi given in A255127.

a(1) = 1; for n > 1, a(n) = A255127(A260738(n)+1, A260739(n)).
Other identities. For all n >= 1:
A269380(a(n)) = n.

A269380 a(1) = 1, after which, for odd numbers: a(n) = A260739(n)-th number k for which A260738(k) = A260738(n)-1, and for even numbers: a(n) = a(n/2).

Original entry on oeis.org

1, 1, 2, 1, 3, 2, 5, 1, 4, 3, 7, 2, 11, 5, 6, 1, 13, 4, 9, 3, 8, 7, 17, 2, 23, 11, 10, 5, 25, 6, 19, 1, 12, 13, 15, 4, 29, 9, 14, 3, 37, 8, 41, 7, 16, 17, 43, 2, 21, 23, 18, 11, 47, 10, 31, 5, 20, 25, 35, 6, 53, 19, 22, 1, 27, 12, 61, 13, 24, 15, 67, 4, 55, 29, 26, 9, 71, 14, 33, 3, 28, 37, 77, 8, 49, 41, 30, 7, 83, 16, 89, 17, 32, 43, 39, 2

Offset: 1

Antti Karttunen, Mar 01 2016

nonn

For odd numbers n > 1, a(n) tells which term is on the immediately preceding row of A255127 (square array generated by Ludic sieve), in the same column where n itself is.

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

Cf. A255127, A260738, A260739.
Cf. A269172, A269355, A269357, A269382, A269386, A269388 (sequences that use this function).
Cf. also A268674, A269370.

a(1) = 1; after which, for even numbers a(n) = a(n/2), and for odd numbers a(n) = A255127(A260738(n)-1, A260739(n)).
Other identities. For all n >= 1:
a(A269379(n)) = n.

A269384 Permutation of natural numbers: a(1) = 1, a(n) = A255127(A001511(n), a(A003602(n))) - 1.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 7, 6, 9, 14, 15, 18, 13, 20, 11, 10, 17, 26, 27, 34, 29, 44, 35, 30, 25, 38, 39, 48, 21, 32, 19, 12, 33, 50, 51, 64, 53, 80, 67, 58, 57, 86, 87, 108, 69, 104, 59, 54, 49, 74, 75, 94, 77, 116, 95, 84, 41, 62, 63, 78, 37, 56, 23, 16, 65, 98, 99, 124, 101, 152, 127, 112, 105, 158, 159, 198, 133, 200

Offset: 1

Antti Karttunen, Mar 01 2016

Permutation obtained from the Ludic sieve.
This sequence can be represented as a binary tree. For n > 2, each left hand child is obtained by doubling the contents of the parent node and subtracting one, and each right hand child is obtained by applying A269382(n), when the parent node contains n:
                                    1
                                    |
                 ...................2...................
                3                                       4
      5......../ \........8                   7......../ \........6
     / \                 / \                 / \                 / \
    /   \               /   \               /   \               /   \
   /     \             /     \             /     \             /     \
  9       14         15       18         13       20         11       10
17 26   27  34     29  44   35  30     25  38   39  48     21  32   19  12
etc.

Antti Karttunen, Table of n, a(n) for n = 1..8192
Index entries for sequences that are permutations of the natural numbers

Inverse: A269383.
Cf. A000035, A001511, A003602, A255127, A269382.
Cf. also A269385, A269387 and also A249814, A269374.

a(1) = 1, a(n) = A255127(A001511(n), a(A003602(n))) - 1.
a(1) = 1, a(2n) = A269382(a(n)), a(2n+1) = (2*a(n+1))-1.
Other identities. For all n >= 0:
A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.]

A269372 Permutation of even numbers: a(n) = A269369(n+1) - 1.

Original entry on oeis.org

0, 2, 6, 4, 18, 10, 8, 16, 12, 22, 38, 28, 14, 34, 20, 40, 60, 46, 26, 52, 24, 58, 80, 64, 30, 70, 44, 76, 102, 82, 32, 88, 36, 94, 122, 100, 42, 106, 56, 112, 144, 118, 48, 124, 54, 130, 164, 136, 50, 142, 62, 148, 186, 154, 84, 160, 96, 166, 206, 172, 90, 178, 66, 184, 228, 190, 68, 196, 72, 202, 248, 208, 74

Offset: 0

Antti Karttunen, Mar 01 2016

nonn

Antti Karttunen, Table of n, a(n) for n = 0..11011

Cf. A269369, A269374.

Cf. also A253886, A269382.

(define (A269372 n) (- (A269369 (+ 1 n)) 1))

a(n) = A269369(1+n) - 1.

cp's OEIS Frontend

A269379 a(1) = 1; for n > 1, a(n) = A255127(A260738(n)+1, A260739(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A269380 a(1) = 1, after which, for odd numbers: a(n) = A260739(n)-th number k for which A260738(k) = A260738(n)-1, and for even numbers: a(n) = a(n/2).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A269384 Permutation of natural numbers: a(1) = 1, a(n) = A255127(A001511(n), a(A003602(n))) - 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A269372 Permutation of even numbers: a(n) = A269369(n+1) - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula