A260438 -id:A260438 - cp's OEIS frontend

A260741 Permutation of natural numbers: a(1) = 1, for n > 1: a(n) = A255127(A260438(n), a(A260439(n))).

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

Offset: 1

Antti Karttunen, Jul 30 2015

nonn

This is a more recursed variant of A260435.

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

Inverse: A260742.
Cf. A000959, A003309, A255127, A260438, A260439.
Similar permutations: A260435, A250245, A250246.

a(1) = 1, for n > 1: a(n) = A255127(A260438(n), a(A260439(n))).
Other identities. For all n >= 1:
a(A000959(n+1)) = A003309(n+2). [Maps Lucky numbers to odd Ludic numbers.]
a(n) = a(2n)/2. [The even bisection halved gives the sequence back.]

A269369 a(1) = 1, a(n) = A260439(n)-th number k for which A260438(k) = A260438(n)+1; a(n) = A255551(A260438(n)+1, A260439(n)).

Original entry on oeis.org

1, 3, 7, 5, 19, 11, 9, 17, 13, 23, 39, 29, 15, 35, 21, 41, 61, 47, 27, 53, 25, 59, 81, 65, 31, 71, 45, 77, 103, 83, 33, 89, 37, 95, 123, 101, 43, 107, 57, 113, 145, 119, 49, 125, 55, 131, 165, 137, 51, 143, 63, 149, 187, 155, 85, 161, 97, 167, 207, 173, 91, 179, 67, 185, 229, 191, 69, 197, 73, 203, 249, 209, 75

Offset: 1

Antti Karttunen, Mar 01 2016

nonn

For n > 1, a(n) = the number located immediately below n in A255551 (square array generated by Lucky sieve) in the same column where n itself is.

Permutation of odd numbers.

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

Cf. A255551, A260438, A260439, A269372, A269375, A269377.
Cf. A269370 (left inverse).
Cf. also A250469, A269379.

(define (A269369 n) (if (= 1 n) n (A255551bi (+ (A260438 n) 1) (A260439 n)))) ;; Code for A255551bi given in A255551.

a(1) = 1; for n > 1, a(n) = A255551(A260438(n)+1, A260439(n)).
Other identities. For all n >= 1:
A269370(a(n)) = n.

A269370 a(1) = 1, after which, for odd n: a(n) = A260439(n)-th number k for which A260438(k) = A260438(n)-1, and for even n: a(n) = a(n/2).

Original entry on oeis.org

1, 1, 2, 1, 4, 2, 3, 1, 7, 4, 6, 2, 9, 3, 13, 1, 8, 7, 5, 4, 15, 6, 10, 2, 21, 9, 19, 3, 12, 13, 25, 1, 31, 8, 14, 7, 33, 5, 11, 4, 16, 15, 37, 6, 27, 10, 18, 2, 43, 21, 49, 9, 20, 19, 45, 3, 39, 12, 22, 13, 17, 25, 51, 1, 24, 31, 63, 8, 67, 14, 26, 7, 69, 33, 73, 5, 28, 11, 75, 4, 23, 16, 30, 15, 55, 37, 79, 6, 32, 27, 61, 10, 87, 18, 34, 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 A255551 (square array generated by Lucky sieve), in the same column where n itself is.

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

Cf. A255551, A260438, A260439, A269369.

Cf. also A268674, A269380.

(define (A269370 n) (cond ((= 1 n) n) ((even? n) (A269370 (/ n 2))) (else (A255551bi (- (A260438 n) 1) (A260439 n))))) ;; Code for A255551bi given in A255551.

a(1) = 1; after which for even n, a(n) = a(n/2), and for odd n, a(n) = A255551(A260438(n)-1, A260439(n)).
Other identities. For all n >= 1:
a(A269369(n)) = n.

A260435 Permutation mapping from Lucky sieve to Ludic sieve: a(1) = 1, for n > 1: a(n) = A255127(A260438(n), A260439(n)).

Original entry on oeis.org

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

Offset: 1

Antti Karttunen, Jul 30 2015

nonn

a(n) tells which number in array A255127 (constructed from Ludic sieve) is at the same position where n is in array A255551 (constructed from Lucky sieve). This permutation fixes all even numbers because both arrays have A005843 as their topmost row.

Inverse: A260436.
Cf. A000959, A003309, A255127, A260438, A260439.
Similar or related permutations: A255407, A255552, A255554, A249817, A249818, A260741 (a more recursed variant).

(define (A260435 n) (if (<= n 1) n (A255127bi (A260438 n) (A260439 n)))) ;; Code for A255127bi given in A255127.

Other identities. For all n >= 1:
a(A000959(n+1)) = A003309(n+2). [Maps Lucky numbers to odd Ludic numbers.]
a(2n) = 2n.
As a composition of related permutations:
a(n) = A255127(A255552(n)).
a(n) = A255407(A255554(n)).

A269373 Permutation of natural numbers: a(1) = 1, a(n) = A000079(A260438(n+1)-1) * ((2 * a(A260439(n+1))) - 1).

Original entry on oeis.org

1, 2, 3, 6, 5, 4, 11, 8, 9, 10, 7, 16, 21, 32, 15, 22, 17, 12, 19, 64, 13, 18, 31, 128, 41, 24, 63, 14, 29, 256, 43, 512, 33, 42, 23, 1024, 37, 20, 127, 30, 25, 2048, 35, 48, 61, 34, 255, 4096, 81, 8192, 47, 38, 125, 96, 27, 40, 57, 26, 511, 44, 85, 16384, 1023, 62, 65, 32768, 83, 65536, 45, 82, 2047, 131072, 73, 262144, 39

Offset: 1

Antti Karttunen, Mar 01 2016

nonn

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

Inverse: A269374.
Cf. A000035, A000079, A260438, A260439.
Cf. also A249813, A269383.

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

A260738 Row index to A255127: a(1) = 0; for n > 1, a(n) = number of the stage where n is removed in the sieve which produces Ludic numbers.

Original entry on oeis.org

0, 1, 2, 1, 3, 1, 4, 1, 2, 1, 5, 1, 6, 1, 2, 1, 7, 1, 3, 1, 2, 1, 8, 1, 9, 1, 2, 1, 10, 1, 4, 1, 2, 1, 3, 1, 11, 1, 2, 1, 12, 1, 13, 1, 2, 1, 14, 1, 3, 1, 2, 1, 15, 1, 5, 1, 2, 1, 4, 1, 16, 1, 2, 1, 3, 1, 17, 1, 2, 1, 18, 1, 6, 1, 2, 1, 19, 1, 3, 1, 2, 1, 20, 1, 4, 1, 2, 1, 21, 1, 22, 1, 2, 1, 3, 1, 23, 1, 2, 1, 7, 1, 5, 1, 2, 1, 24, 1, 3, 1, 2, 1, 4, 1, 25, 1, 2, 1, 26, 1

Offset: 1

Antti Karttunen, Jul 30 2015

nonn

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

Row index to array A255127.
Cf. A003309, A254100.
Cf. A260739 (corresponding column index).
Cf. A055396, A260438 for row indices to other arrays similar to A255127.
Differs from A055396 for the first time at n=19.

(define (A260738 n) (cond ((= 1 n) 0) ((even? n) 1) (else (let searchrow ((row 2)) (let searchcol ((col 1)) (cond ((>= (A255127bi row col) n) (if (= (A255127bi row col) n) row (searchrow (+ 1 row)))) (else (searchcol (+ 1 col))))))))) ;; Code for A255127bi given in A255127.

Other identities. For all n >= 1:
a(A003309(n)) = n-1. [In Ludic sieve A003309(k+1) (i.e., the k-th Ludic number after 1) is the first among the numbers removed at stage k.]
a(2n) = 1. [All even numbers are removed at the stage one of the sieve.]
a(A016945(n)) = 2, a(A255413(n)) = 3, a(A255414(n)) = 4, ..., a(A255419(n)) = 9.
a(A254100(n)) = n.
For all n >= 2:
A255127(a(n), A260739(n)) = n.

A260439 Column index to A255551: a(1) = 0; for n > 1: if n is Lucky number then a(n) = 1, otherwise for a(2k) = k, and for odd unlucky numbers, a(n) = 1 + the position at the stage where n is removed in the Lucky sieve.

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 1, 4, 1, 5, 3, 6, 1, 7, 1, 8, 4, 9, 2, 10, 1, 11, 5, 12, 1, 13, 2, 14, 6, 15, 1, 16, 1, 17, 7, 18, 1, 19, 3, 20, 8, 21, 1, 22, 2, 23, 9, 24, 1, 25, 1, 26, 10, 27, 2, 28, 3, 29, 11, 30, 4, 31, 1, 32, 12, 33, 1, 34, 1, 35, 13, 36, 1, 37, 1, 38, 14, 39, 1, 40, 5, 41, 15, 42, 2, 43, 1, 44, 16, 45, 4, 46, 1, 47, 17, 48, 3, 49, 1, 50, 18, 51, 6, 52, 1

Offset: 1

Antti Karttunen, Jul 29 2015

nonn

a(1) = 0, because 1 is outside of A255551 array proper.

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

Cf. A000959, A050505, A145649, A255543, A255551.
Cf. also A260438 (corresponding row index).
Cf. A078898, A246277, A260429, A260437, A260739 for column indices to other arrays similar to A255551.

(define (A260439 n) (cond ((= 1 n) 0) ((not (zero? (A145649 n))) 1) ((even? n) (/ n 2)) (else (let searchrow ((row 2)) (let searchcol ((col 1)) (cond ((>= (A255543bi row col) n) (if (= (A255543bi row col) n) (+ 1 col) (searchrow (+ 1 row)))) (else (searchcol (+ 1 col))))))))) ;; Code for A255543bi given in A255543.

Other identities. For all n >= 1:
a(2n) = n.
Also, for all n >= 2:
A255551(A260438(n), a(n)) = n.
a(A219178(n)) = 2.

A260429 Column index to A255545: if n is Lucky number, then a(n) = 1, otherwise a(n) = 1 + the position at the stage where n is removed in the Lucky sieve.

Original entry on oeis.org

1, 2, 1, 3, 2, 4, 1, 5, 1, 6, 3, 7, 1, 8, 1, 9, 4, 10, 2, 11, 1, 12, 5, 13, 1, 14, 2, 15, 6, 16, 1, 17, 1, 18, 7, 19, 1, 20, 3, 21, 8, 22, 1, 23, 2, 24, 9, 25, 1, 26, 1, 27, 10, 28, 2, 29, 3, 30, 11, 31, 4, 32, 1, 33, 12, 34, 1, 35, 1, 36, 13, 37, 1, 38, 1, 39, 14, 40, 1, 41, 5, 42, 15, 43, 2, 44, 1, 45, 16, 46, 4, 47, 1, 48, 17, 49, 3, 50, 1, 51, 18, 52, 6, 53, 1

Offset: 1

Antti Karttunen, Jul 29 2015

nonn

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

One more than A260437.
Cf. A000959, A050505, A145649, A219178, A255543, A255545.
Cf. also A260438 (corresponding row index).
Cf. A078898, A246277, A260439, A260739 for column indices to other arrays similar to A255545.

(define (A260429 n) (cond ((not (zero? (A145649 n))) 1) ((even? n) (+ 1 (/ n 2))) (else (let searchrow ((row 2)) (let searchcol ((col 1)) (cond ((>= (A255543bi row col) n) (if (= (A255543bi row col) n) (+ 1 col) (searchrow (+ 1 row)))) (else (searchcol (+ 1 col))))))))) ;; Code for A255543bi given in A255543.

Other identities. For all n >= 1:
a(n) = 1 + A260437(n).
Iff A145649(n) = 1, then a(n) = 1.
a(2n) = n+1. [Even numbers are removed at the stage one of the sieve, after 1 which is also removed in the beginning.]
a(A219178(n)) = 2.
A255545(A260438(n), a(n)) = n.

A264940 Lucky factor of n.

Original entry on oeis.org

0, 2, 0, 2, 3, 2, 0, 2, 0, 2, 3, 2, 0, 2, 0, 2, 3, 2, 7, 2, 0, 2, 3, 2, 0, 2, 9, 2, 3, 2, 0, 2, 0, 2, 3, 2, 0, 2, 7, 2, 3, 2, 0, 2, 13, 2, 3, 2, 0, 2, 0, 2, 3, 2, 15, 2, 9, 2, 3, 2, 7, 2, 0, 2, 3, 2, 0, 2, 0, 2, 3, 2, 0, 2, 0, 2, 3, 2, 0, 2, 7, 2, 3, 2, 21, 2

Offset: 1

Max Barrentine, Dec 09 2015

nonn

This sequence is analogous to the smallest prime factor of n (A020639). If n is lucky, a(n)=0; if n is unlucky, a(n) is the number that rejects n from the lucky number sieve. This is 2 for even numbers, and a lucky number >= 3 for odd unlucky numbers.

Max Barrentine, Table of n, a(n) for n = 1..10000

Cf. A000959, A050505, A145649, A219178, A255543, A255545, A260438, A265859.

Cf. A020639, A271419 (somewhat analogous sequences).

(define (A264940 n) (if (= 1 (A145649 n)) 0 (if (even? n) 2 (A000959 (A260438 n))))) ;; Antti Karttunen, Sep 11 2016

From Antti Karttunen, Sep 11 2016: (Start)
If A145649(n) = 1 [when n is lucky], a(n) = 0, else if n is even, a(n) = 2, otherwise a(n) = A000959(A265859(n)) = A000959(A260438(n)).
For n >= 2, a(A219178(n)) = A000959(n).
(End)

Formula corrected and comment clarified by Antti Karttunen, Sep 11 2016

A260437 Column index to A255543: if n is Lucky number then a(n) = 0, otherwise a(n) = the position at the stage where n is removed in the Lucky sieve.

Original entry on oeis.org

0, 1, 0, 2, 1, 3, 0, 4, 0, 5, 2, 6, 0, 7, 0, 8, 3, 9, 1, 10, 0, 11, 4, 12, 0, 13, 1, 14, 5, 15, 0, 16, 0, 17, 6, 18, 0, 19, 2, 20, 7, 21, 0, 22, 1, 23, 8, 24, 0, 25, 0, 26, 9, 27, 1, 28, 2, 29, 10, 30, 3, 31, 0, 32, 11, 33, 0, 34, 0, 35, 12, 36, 0, 37, 0, 38, 13, 39, 0, 40, 4, 41, 14, 42, 1, 43, 0, 44, 15, 45, 3, 46, 0, 47, 16, 48, 2, 49, 0, 50, 17, 51, 5, 52

Offset: 1

Antti Karttunen, Aug 02 2015

nonn

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

One less than A260429.
Cf. A000959, A050505, A145649, A219178, A255543.
Cf. also A260438 (corresponding row index).

(define (A260437 n) (cond ((not (zero? (A145649 n))) 0) ((even? n) (/ n 2)) (else (let searchrow ((row 2)) (let searchcol ((col 1)) (cond ((>= (A255543bi row col) n) (if (= (A255543bi row col) n) col (searchrow (+ 1 row)))) (else (searchcol (+ 1 col))))))))) ;; Code for A255543bi given in A255543.

Other identities. For all n >= 1:
a(n) = A260429(n) - 1.
Iff A145649(n) = 1, then a(n) = 0.
a(2n) = n.
a(A219178(n)) = 1.
A255543(A260438(A050505(n)), a(A050505(n))) = A050505(n).

cp's OEIS Frontend

A260741 Permutation of natural numbers: a(1) = 1, for n > 1: a(n) = A255127(A260438(n), a(A260439(n))).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A269369 a(1) = 1, a(n) = A260439(n)-th number k for which A260438(k) = A260438(n)+1; a(n) = A255551(A260438(n)+1, A260439(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A269370 a(1) = 1, after which, for odd n: a(n) = A260439(n)-th number k for which A260438(k) = A260438(n)-1, and for even n: a(n) = a(n/2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A260435 Permutation mapping from Lucky sieve to Ludic sieve: a(1) = 1, for n > 1: a(n) = A255127(A260438(n), A260439(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A269373 Permutation of natural numbers: a(1) = 1, a(n) = A000079(A260438(n+1)-1) * ((2 * a(A260439(n+1))) - 1).

Views

Author

Keywords

Links

Crossrefs

Formula

A260738 Row index to A255127: a(1) = 0; for n > 1, a(n) = number of the stage where n is removed in the sieve which produces Ludic numbers.

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula

A260439 Column index to A255551: a(1) = 0; for n > 1: if n is Lucky number then a(n) = 1, otherwise for a(2k) = k, and for odd unlucky numbers, a(n) = 1 + the position at the stage where n is removed in the Lucky sieve.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A260429 Column index to A255545: if n is Lucky number, then a(n) = 1, otherwise a(n) = 1 + the position at the stage where n is removed in the Lucky sieve.

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula

A264940 Lucky factor of n.

Views

Author

Keywords

Comments

Links