A360613 -id:A360613 - cp's OEIS frontend

A360627 Odd bisection of A360613: a(n) = A360613(2*n-1).

1, 2, 4, 7, 9, 13, 14, 18, 23, 25, 26, 28, 36, 41, 43, 46, 50, 52, 59, 61, 63, 67, 73, 81, 82, 86, 88, 91, 92, 97, 100, 107, 113, 117, 118, 122, 126, 134, 137, 146, 149, 151, 157, 161, 162, 163, 164, 169, 172, 175, 176, 182, 191, 193, 194, 207, 211, 214, 225

Offset: 1

Rémy Sigrist, Feb 14 2023

nonn

See A360628 for the even bisection.

The ratios between distinct terms of this sequence are all different from the ratios between distinct terms of A360628.

Rémy Sigrist, C program

Cf. A360613, A360628, A360633.

C
```
See Links section.
```

a(n) < a(n+1).

A360628 Even bisection of A360613: a(n) = A360613(2*n).

Original entry on oeis.org

1, 3, 5, 8, 11, 15, 17, 19, 24, 29, 31, 33, 37, 40, 47, 49, 51, 53, 55, 57, 64, 71, 79, 83, 85, 87, 89, 93, 95, 101, 103, 109, 111, 120, 121, 127, 131, 136, 139, 141, 145, 147, 152, 155, 159, 165, 167, 173, 179, 181, 185, 187, 192, 197, 199, 209, 213, 223, 227

Offset: 1

Rémy Sigrist, Feb 14 2023

nonn

See A360627 for the odd bisection.

Rémy Sigrist, C program

Cf. A360613, A360627, A360633.

C
```
See Links section.
```

a(n) < a(n+1).

A360633 Square array A(n, k), n, k > 0, read by antidiagonals upwards; A(n, k) = A360613(2n-1) A360613(2*k).

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 7, 12, 10, 8, 9, 21, 20, 16, 11, 13, 27, 35, 32, 22, 15, 14, 39, 45, 56, 44, 30, 17, 18, 42, 65, 72, 77, 60, 34, 19, 23, 54, 70, 104, 99, 105, 68, 38, 24, 25, 69, 90, 112, 143, 135, 119, 76, 48, 29, 26, 75, 115, 144, 154, 195, 153, 133, 96, 58, 31

Offset: 1

Rémy Sigrist, Feb 14 2023

This sequence can be seen as a greedy multiplication table where we alternately add rows and columns so that all products are distinct.

Conjecture: all integers appear in this sequence.

			Array A(n, k) begins:
  n\k |  1   2    3    4    5    6    7    8    9   10
  ----+-----------------------------------------------
    1 |  1   3    5    8   11   15   17   19   24   29
    2 |  2   6   10   16   22   30   34   38   48   58
    3 |  4  12   20   32   44   60   68   76   96  116
    4 |  7  21   35   56   77  105  119  133  168  203
    5 |  9  27   45   72   99  135  153  171  216  261
    6 | 13  39   65  104  143  195  221  247  312  377
    7 | 14  42   70  112  154  210  238  266  336  406
    8 | 18  54   90  144  198  270  306  342  432  522
    9 | 23  69  115  184  253  345  391  437  552  667
   10 | 25  75  125  200  275  375  425  475  600  725

Rémy Sigrist, Table of n, a(n) for n = 1..10011
Rémy Sigrist, C program

Cf. A249327, A360613, A360627, A360628.

C
```
See Links section.
```

A(n, k) = A360627(n) * A360628(k).
A(n, 1) = A360627(n).
A(1, k) = A360628(k).

cp's OEIS Frontend

A360627 Odd bisection of A360613: a(n) = A360613(2*n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C

Formula

A360628 Even bisection of A360613: a(n) = A360613(2*n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C

Formula

A360633 Square array A(n, k), n, k > 0, read by antidiagonals upwards; A(n, k) = A360613(2n-1) A360613(2*k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

C

Formula

cp's OEIS Frontend

A360627 Odd bisection of A360613: a(n) = A360613(2*n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C

Formula

A360628 Even bisection of A360613: a(n) = A360613(2*n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

C

Formula

A360633 Square array A(n, k), n, k > 0, read by antidiagonals upwards; A(n, k) = A360613(2*n-1) * A360613(2*k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

C

Formula

A360633 Square array A(n, k), n, k > 0, read by antidiagonals upwards; A(n, k) = A360613(2n-1) A360613(2*k).