A249745 -id:A249745 - cp's OEIS frontend

A251721 Square array of permutations: A(row,col) = A249822(row, A249821(row+1, col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

1, 2, 1, 3, 2, 1, 5, 3, 2, 1, 4, 4, 3, 2, 1, 7, 6, 4, 3, 2, 1, 11, 7, 5, 4, 3, 2, 1, 6, 9, 6, 5, 4, 3, 2, 1, 13, 10, 7, 6, 5, 4, 3, 2, 1, 17, 5, 8, 7, 6, 5, 4, 3, 2, 1, 10, 12, 10, 8, 7, 6, 5, 4, 3, 2, 1, 19, 15, 11, 9, 8, 7, 6, 5, 4, 3, 2, 1, 9, 8, 13, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 8, 16, 14, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 23, 19, 15, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1

Offset: 1

Antti Karttunen, Dec 07 2014

These are the "first differences" between permutations of array A249821, in a sense that by composing the first k rows of this array [from left to right, as in a(n) = row_1(row_2(...(row_k(n))))], one obtains row k+1 of A249821.

On row n, the first A250473(n) terms are fixed, and the first non-fixed term comes at A250474(n).

			The top left corner of the array:
1, 2, 3, 5, 4, 7, 11, 6, 13, 17, 10, 19, 9, 8, 23, 29, 14, 15, 31, 22, ...
1, 2, 3, 4, 6, 7, 9, 10, 5, 12, 15, 8, 16, 19, 21, 22, 13, 24, 11, 27, ...
1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 9, 16, 18, 20, 21, 23, 24, ...
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 17, 18, 19, 20, 22, ...
...

Inverse permutations can be found from array A251722.
Row 1: A064216, Row 2: A249745, Row 3: A250475.
Cf. A000027, A002260, A004736, A078898, A083221, A246277, A246278, A249821, A249822, A250473, A250474.

(define (A251721bi row col) (A249822bi row (A249821bi (+ row 1) col)))
(define (A251721 n) (A251721bi (A002260 n) (A004736 n)))
;; Code for A249821bi and A249822bi given in A249821, A249822.

A(row,col) = A249822(row, A249821(row+1, col)).

A(row,col) = A078898(A246278(row, A246277(A083221(row+1, col)))).

A135765 Distribute the odd numbers in columns based on the occurrence of "3" in each prime factorization; square array A(row, col) = 3^(row-1) * A007310(col), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Original entry on oeis.org

1, 5, 3, 7, 15, 9, 11, 21, 45, 27, 13, 33, 63, 135, 81, 17, 39, 99, 189, 405, 243, 19, 51, 117, 297, 567, 1215, 729, 23, 57, 153, 351, 891, 1701, 3645, 2187, 25, 69, 171, 459, 1053, 2673, 5103, 10935, 6561, 29, 75, 207, 513, 1377, 3159, 8019, 15309, 32805

Offset: 1

Alford Arnold, Nov 28 2007

The Table can be constructed by multiplying sequence A000244 by A007310.
From Antti Karttunen, Jan 26 2015: (Start)
A permutation of odd numbers. Adding one to each term and then dividing by two gives a related table A254051, which for any odd number, located in this array as x = A(row,col), gives the result at A254051(row+1,col) after one combined Collatz step (3x+1)/2 -> x (A165355) has been applied.
Each odd number n occurs here in position A(A007949(n), A126760(n)).
Compare also to A135764.
(End)

			The top left corner of the array:
    1,    5,    7,   11,   13,   17,   19,   23,   25,   29,   31,   35, ...
    3,   15,   21,   33,   39,   51,   57,   69,   75,   87,   93,  105, ...
    9,   45,   63,   99,  117,  153,  171,  207,  225,  261,  279,  315, ...
   27,  135,  189,  297,  351,  459,  513,  621,  675,  783,  837,  945, ...
   81,  405,  567,  891, 1053, 1377, 1539, 1863, 2025, 2349, 2511, 2835, ...
  243, 1215, 1701, 2673, 3159, 4131, 4617, 5589, 6075, 7047, 7533, 8505, ...
etc.
For n = 6, we have [A002260(6), A004736(6)] = [3, 1] (that is 6 corresponds to location 3,1 (row,col) in above table) and A(3,1) = A000244(3-1) * A007310(1) = 3^2 * 1 = 9.
For n = 9, we have [A002260(9), A004736(9)] = [3, 2] (9 corresponds to location 3,2) and A(3,2) = A000244(3-1) * A007310(2) = 3^2 * 5 = 9*5 = 45.
For n = 13, we have [A002260(13), A004736(13)] = [3, 3] (13 corresponds to location 3,3) and A(3,3) = A000244(3-1) * A007310(3) = 3^2 * 7 = 9*7 = 63.
For n = 23, we have [A002260(23), A004736(23)] = [2, 6] (23 corresponds to location 2,6) and A(2,6) = A000244(2-1) * A007310(6) = 3^1 * 17 = 51.

Row 1: A007310.
Column 1: A000244.
Cf. A007949 (row index), A126760 (column index).
Cf. also A000265, A002260, A003961, A004736, A005408, A165355, A249745.
Related arrays: A135764, A254051, A254055, A254101, A254102.

N:= 20:
B:= [seq(op([6*n+1,6*n+5]),n=0..floor((N-1)/2))]:
[seq(seq(3^j*B[i-j],j=0..i-1),i=1..N)]; # Robert Israel, Jan 26 2015

From Antti Karttunen, Jan 26 2015: (Start)
With both row and col starting from 1:
A(row, col) = A000244(row-1) * A007310(col) = 3^(row-1) * A007310(col).
a(n) = (2*A254051(n))-1.
a(n) = A003961(A254053(n)).
Above in array form:
A(row,col) = A003961(A254053(row,col)) = A003961(A135764(row,A249745(col))).
(End)

Name amended and examples edited by Antti Karttunen, Jan 26 2015

A249735 Odd bisection of A003961: Replace in 2n-1 each prime factor p(k) with prime p(k+1).

Original entry on oeis.org

1, 5, 7, 11, 25, 13, 17, 35, 19, 23, 55, 29, 49, 125, 31, 37, 65, 77, 41, 85, 43, 47, 175, 53, 121, 95, 59, 91, 115, 61, 67, 275, 119, 71, 145, 73, 79, 245, 143, 83, 625, 89, 133, 155, 97, 187, 185, 161, 101, 325, 103, 107, 385, 109, 113, 205, 127, 203, 425, 209, 169, 215, 343, 131, 235, 137, 253, 875, 139, 149, 265, 221, 217, 605, 151

Offset: 1

Antti Karttunen, Nov 23 2014

nonn

This has the same terms as A007310 (Numbers congruent to 1 or 5 mod 6), but in different order. Apart from 1, they are the numbers that occur below the first two rows of arrays like A246278 and A083221 (A083140).

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

Cf. A249734 (the other bisection of A003961).

Cf. also A007310 (A038179), A249746.

(define (A249735 n) (A003961 (+ n n -1)))

a(n) = A003961(2n - 1).
a(n) = A007310(A249746(n)). [Permutation of A007310, Numbers congruent to 1 or 5 mod 6.]
Other identities. For all n >= 1:
A007310(n) = a(A249745(n)).
A246277(5*a(A048673(n))) = n.
A246277(5*a(n)) = A064216(n).

A249823 Permutation of natural numbers: a(n) = A246277(A084967(n)).

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 17, 4, 19, 23, 6, 29, 31, 37, 41, 9, 43, 10, 47, 53, 14, 59, 61, 67, 15, 71, 73, 22, 79, 21, 26, 83, 89, 97, 101, 103, 107, 34, 33, 25, 8, 109, 113, 39, 127, 131, 35, 38, 137, 139, 46, 149, 51, 151, 157, 49, 163, 12, 167, 173, 58, 55, 179, 181, 191, 193, 57, 62, 65, 197, 74, 69, 77, 199, 211, 223, 227, 82, 229, 233, 18

Offset: 1

Antti Karttunen, Nov 06 2014

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

Inverse: A249824.
Row 3 of A249821.
Cf. A064216, A084967, A246277, A249745, A249825, A250476.

(define (A249823 n) (A246277 (A084967 n)))

a(n) = A246277(A084967(n)).
As a composition of other permutations:
a(n) = A064216(A249745(n)).
a(n) = A249825(A250476(n)).

A249825 Permutation of natural numbers: a(n) = A246277(A084968(n)).

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 4, 41, 43, 47, 53, 59, 61, 6, 67, 71, 73, 10, 79, 83, 89, 97, 101, 103, 14, 9, 107, 109, 22, 113, 127, 15, 131, 137, 139, 26, 149, 151, 25, 157, 163, 167, 21, 173, 179, 181, 191, 34, 33, 193, 38, 35, 197, 199, 211, 223, 227, 229, 55, 233, 39, 239, 46, 241, 251, 257, 263, 269, 271, 58, 49

Offset: 1

Antti Karttunen, Dec 06 2014

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

Inverse: A249826.
Row 4 of A249821.
Cf. A084968, A246277, A251721, A064216, A249823, A249745, A250475.

(define (A249825 n) (A246277 (A084968 n)))

a(n) = A246277(A084968(n)).
As a composition of other permutations:
a(n) = A249823(A250475(n)).
a(n) = A064216(A249745(A250475(n))). [Composition of the first three rows of array A251721.]

A254055 Square array: A(row,col) = A003602(A254051(row,col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Original entry on oeis.org

1, 2, 1, 1, 1, 3, 2, 6, 12, 4, 4, 9, 1, 9, 21, 5, 3, 13, 48, 102, 31, 3, 7, 30, 75, 36, 10, 183, 2, 15, 39, 6, 112, 426, 912, 274, 7, 18, 22, 58, 264, 669, 160, 684, 1641, 8, 10, 7, 129, 345, 198, 1003, 3828, 8202, 2461, 1, 6, 57, 156, 193, 517, 2370, 6015, 2871, 3076, 14763, 5, 24, 66, 85, 117, 1155, 3099, 889, 9022, 34446, 73812, 22144

Offset: 1

Antti Karttunen, Jan 27 2015

Starting with an odd number x = A135765(row,col), the result after one combined Collatz step (3x+1)/2 is found in A254051(row+1,col), and after iterated [i.e., we divide all powers of 2 out] Collatz step: x_new <- A139391(x) = A000265(3x+1) the resulting odd number x_new is located A135764(1,A(row+1,col)).

What the resulting odd number will be, is given by A254101(row+1,col).

			The top left corner of the array:
    1,   2,    1,    2,    4,    5,     3,     2,    7,    8,     1, ...
    1,   1,    6,    9,    3,    7,    15,    18,   10,    6,    24, ...
    3,  12,    1,   13,   30,   39,    22,     7,   57,   66,    18, ...
    4,   9,   48,   75,    6,   58,   129,   156,   85,   25,   210, ...
   21, 102,   36,  112,  264,  345,   193,   117,  507,  588,    79, ...
   31,  10,  426,  669,  198,  517,  1155,  1398,  760,  441,  1884, ...
  183, 912,  160, 1003, 2370, 3099,  1732,    66, 4557, 5286,  1413, ...
  274, 684, 3828, 6015,  889, 4648, 10389, 12576, 6835,  496, 16950, ...
etc.

Antti Karttunen, Table of n, a(n) for n = 1..10440; the first 144 antidiagonals of array

Cf. A003602, A002260, A004736.

Related arrays: A135764, A135765, A254051, A254101, A254102.

A273664 a(n) = A249746(A032766(n)).

Original entry on oeis.org

1, 3, 4, 5, 6, 7, 8, 10, 17, 11, 13, 26, 14, 15, 16, 18, 41, 20, 31, 21, 23, 40, 24, 25, 27, 48, 28, 30, 45, 33, 63, 54, 34, 35, 36, 37, 38, 43, 68, 70, 57, 115, 44, 46, 85, 47, 50, 74, 73, 51, 53, 87, 55, 107, 56, 58, 97, 60, 180, 61, 64, 96, 83, 65, 66, 67, 71, 114, 101, 100, 75, 110, 136, 108, 76, 77, 78, 80, 124, 81

Offset: 1

Antti Karttunen, Aug 06 2016

nonn

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

Cf. A032766, A249745, A249746, A249824, A254049, A254050, A275716.

Cf. also A273669 (natural numbers not in this sequence).

t = PositionIndex[FactorInteger[#][[1, 1]] & /@ Range[10^6]]; f[n_] := Times @@ Power[If[# == 1, 1, NextPrime@ #] & /@ First@ #, Last@ #] &@ Transpose@ FactorInteger@ n; Flatten@ Map[Position[Lookup[t, FactorInteger[#][[1, 1]]], #] &[f@ f[2 #]] &, Map[Times @@ Power[If[# == 1, 1, NextPrime[#, -1]] & /@ First@#, Last@#] &@ Transpose@ FactorInteger[2 # - 1] &, Floor[#/2] + # & /@ Range@ 80]] (* Michael De Vlieger, Aug 07 2016, Version 10 *)

(define (A273664 n) (A249746 (A032766 n)))

a(n) = A249746(A032766(n)).
a(n) = A249824(A254050(n)).
a(n) = A249746(A254049(A249745(n))).

A254101 Square array A(row,col) = A000265(A254051(row,col)).

Original entry on oeis.org

1, 3, 1, 1, 1, 5, 3, 11, 23, 7, 7, 17, 1, 17, 41, 9, 5, 25, 95, 203, 61, 5, 13, 59, 149, 71, 19, 365, 3, 29, 77, 11, 223, 851, 1823, 547, 13, 35, 43, 115, 527, 1337, 319, 1367, 3281, 15, 19, 13, 257, 689, 395, 2005, 7655, 16403, 4921, 1, 11, 113, 311, 385, 1033, 4739, 12029, 5741, 6151, 29525

Offset: 1

Antti Karttunen, Jan 28 2015

Starting with an odd number x = A135765(row,col), the result after one combined Collatz step (3x+1)/2 is found in A254051(row+1,col), and after iterated [i.e., we divide all powers of 2 out] Collatz step: x_new <- A139391(x) = A000265(3x+1) the resulting odd number x_new is located at the first row of array A135764 as x_new = A135764(1,A254055(row+1,col)) and it is given here as A(row+1,col) = A000265(A254051(row+1,col)).

That number's column index in array A135765 is then given by A254102(row+1,col).

			The top left corner of the array:
    1,    3,    1,     3,    7,    9,     5,     3,    13,    15,     1, ...
    1,    1,   11,    17,    5,   13,    29,    35,    19,    11,    47, ...
    5,   23,    1,    25,   59,   77,    43,    13,   113,   131,    35, ...
    7,   17,   95,   149,   11,  115,   257,   311,   169,    49,   419, ...
   41,  203,   71,   223,  527,  689,   385,   233,  1013,  1175,   157, ...
   61,   19,  851,  1337,  395, 1033,  2309,  2795,  1519,   881,  3767, ...
  365, 1823,  319,  2005, 4739, 6197,  3463,   131,  9113, 10571,  2825, ...
  547, 1367, 7655, 12029, 1777, 9295, 20777, 25151, 13669,   991, 33899, ...
etc.

Cf. A000265, A002260, A004736, A003961, A139391, A249745.

Related arrays: A135764, A135765, A254051, A254055, A254102.

(define (A254101 n) (A254101bi (A002260 n) (A004736 n)))
(define (A254101bi row col) (+ -1 (* 2 (A254055bi row col))))
;; Alternative definition:
(define (A254101v2 n) (A254101biv2 (A002260 n) (A004736 n)))
(define (A254101biv2 row col) (A003961 (A254055bi row (A249745 col))))

A(row,col) = A000265(A254051(row,col)).
A(row,col) = (2*A254055(row,col))-1.
A(row,col) = A003961(A254055(row, A249745(col))).
A(row+1,col) = A139391(A135765(row,col)).
As compositions of one-dimensional sequences:
a(n) = A000265(A254051(n)).
a(n) = (2*A254055(n))-1.

A353420 a(n) = A126760(A003961(n)).

Original entry on oeis.org

1, 1, 2, 1, 3, 2, 4, 1, 9, 3, 5, 2, 6, 4, 12, 1, 7, 9, 8, 3, 19, 5, 10, 2, 17, 6, 42, 4, 11, 12, 13, 1, 22, 7, 26, 9, 14, 8, 29, 3, 15, 19, 16, 5, 59, 10, 18, 2, 41, 17, 32, 6, 20, 42, 31, 4, 39, 11, 21, 12, 23, 13, 92, 1, 40, 22, 24, 7, 49, 26, 25, 9, 27, 14, 82, 8, 48, 29, 28, 3, 209, 15, 30, 19, 45, 16, 52, 5, 33

Offset: 1

Antti Karttunen, Apr 20 2022

nonn

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from indices in prime factorization

Cf. A000265, A003602, A003961, A048673, A126760, A249735, A249745, A249746.

Cf. A353335 (Dirichlet inverse), A353336 (sum with it).

A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
A126760(n) = {n&&n\=3^valuation(n, 3)<A126760
A353420(n) = A126760(A003961(n));

a(n) = A126760(A003961(n)) = A249746(A003602(n)) = A126760(A249735(A003602(n))).
a(n) = A353336(4*n) = A353336(n) - A353335(n).
For all n >= 1, a(n) = a(2*n) = a(A000265(n)).
For all n >= 1, A249745(a(n)) = A003602(n).

cp's OEIS Frontend

A251721 Square array of permutations: A(row,col) = A249822(row, A249821(row+1, col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Scheme

Formula

A135765 Distribute the odd numbers in columns based on the occurrence of "3" in each prime factorization; square array A(row, col) = 3^(row-1) * A007310(col), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula

Extensions

A249735 Odd bisection of A003961: Replace in 2n-1 each prime factor p(k) with prime p(k+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A249823 Permutation of natural numbers: a(n) = A246277(A084967(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula

A249825 Permutation of natural numbers: a(n) = A246277(A084968(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

Formula

A254055 Square array: A(row,col) = A003602(A254051(row,col)), read by antidiagonals A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A273664 a(n) = A249746(A032766(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A254101 Square array A(row,col) = A000265(A254051(row,col)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Scheme

Formula