A135765 -id:A135765 - cp's OEIS frontend

A003602 Kimberling's paraphrases: if n = (2k-1)*2^m then a(n) = k.

1, 1, 2, 1, 3, 2, 4, 1, 5, 3, 6, 2, 7, 4, 8, 1, 9, 5, 10, 3, 11, 6, 12, 2, 13, 7, 14, 4, 15, 8, 16, 1, 17, 9, 18, 5, 19, 10, 20, 3, 21, 11, 22, 6, 23, 12, 24, 2, 25, 13, 26, 7, 27, 14, 28, 4, 29, 15, 30, 8, 31, 16, 32, 1, 33, 17, 34, 9, 35, 18, 36, 5, 37, 19, 38, 10, 39, 20, 40, 3, 41, 21, 42

Offset: 1

N. J. A. Sloane, Mira Bernstein

Fractal sequence obtained from powers of 2.
k occurs at (2*k-1)*A000079(m), m >= 0. - Robert G. Wilson v, May 23 2006
Sequence is T^(oo)(1) where T is acting on a word w = w(1)w(2)..w(m) as follows: T(w) = "1"w(1)"2"w(2)"3"(...)"m"w(m)"m+1". For instance T(ab) = 1a2b3. Thus T(1) = 112, T(T(1)) = 1121324, T(T(T(1))) = 112132415362748. - Benoit Cloitre, Mar 02 2009
Note that iterating the post-numbering operator U(w) = w(1) 1 w(2) 2 w(3) 3... produces the same limit sequence except with an additional "1" prepended, i.e., 1,1,1,2,1,3,2,4,... - Glen Whitney, Aug 30 2023
In the binary expansion of n, first swallow all zeros from the right, then add 1, and swallow the now-appearing 0 bit as well. - Ralf Stephan, Aug 22 2013
Although A264646 and this sequence initially agree in their digit-streams, they differ after 48 digits. - N. J. A. Sloane, Nov 20 2015
"[This is a] fractal because we get the same sequence after we delete from it the first appearance of all positive integers" - see Cobeli and Zaharescu link. - Robert G. Wilson v, Jun 03 2018
From Peter Munn, Jun 16 2022: (Start)
The sequence is the list of positive integers interleaved with the sequence itself. Provided the offset is suitable (which is the case here) a term of such a self-interleaved sequence is determined by the odd part of its index. Putting some of the formulas given here into words, a(n) is the position of the odd part of n in the list of odd numbers.
Applying the interleaving transform again, we get A110963.
(End)
Omitting all 1's leaves A131987 + 1. - David James Sycamore, Jul 26 2022
a(n) is also the smallest positive number not among the terms between a(a(n-1)) and a(n-1) inclusive (with a(0)=1 prepended). - Neal Gersh Tolunsky, Mar 07 2023

			From _Peter Munn_, Jun 14 2022: (Start)
Start of table showing the interleaving with the positive integers:
   n  a(n)  (n+1)/2  a(n/2)
   1    1      1
   2    1               1
   3    2      2
   4    1               1
   5    3      3
   6    2               2
   7    4      4
   8    1               1
   9    5      5
  10    3               3
  11    6      6
  12    2               2
(End)

Michel Rigo, Formal Languages, Automata and Numeration Systems, 2 vols., Wiley, 2014. Mentions this sequence - see "List of Sequences" in Vol. 2.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, Table of n, a(n) for n = 1..10000
J.-P. Allouche and J. Shallit, The ring of k-regular sequences, II, Theoret. Computer Sci., 307 (2003), 3-29.
Cristian Cobeli and Alexandru Zaharescu, Promenade around Pascal Triangle - Number Motives, Bull. Math. Soc. Sci. Math. Roumanie, Tome 56(104) No. 1, 2013, 73-98.
J.-P. Delahaye, La marelle arithmétique, Pour la Science, No. 360, October 2007. In French.
Dale Gerdemann, Plotting Adjacent Points in A003602, Kimberling's Paraphrase, YouTube Video, 2015.
Dale Gerdemann, Plotting Adjacent Terms of A003602 Modulo Increasing Powers of 2, YouTube Video, 2015.
Douglas E. Iannucci and Urban Larsson, Game values of arithmetic functions, arXiv:2101.07608 [math.NT], 2021.
Jonas Kaiser, On the relationship between the Collatz conjecture and Mersenne prime numbers, arXiv preprint arXiv:1608.00862 [math.GM], 2016.
Clark Kimberling, Numeration systems and fractal sequences, Acta Arithmetica 73 (1995) 103-117.
Clark Kimberling, Fractal sequences
Ralf Stephan, Some divide-and-conquer sequences ...
Ralf Stephan, Table of generating functions
Matty van-Son, Palindromic sequences of the Markov spectrum, arXiv:1804.10802 [math.NT], 2018.
Eric Weisstein's World of Mathematics, Odd Part
Index entries for sequences related to binary expansion of n

a(n) is the index of the column in A135764 where n appears (see also A054582).
Cf. A000079, A000265, A001511, A003603, A003961, A014577 (with offset 1, reduction mod 2), A025480, A035528, A048673, A101279, A110963, A117303, A126760, A181988, A220466, A249745, A253887, A337821 (2-adic valuation).
Cf. also A349134 (Dirichlet inverse), A349135 (sum with it), A349136 (Möbius transform), A349431, A349371 (inverse Möbius transform).
Cf. A065120, A131987.
Cf. A264646.
Cf. A123390, A118319.

a003602 = (`div` 2) . (+ 1) . a000265
-- Reinhard Zumkeller, Feb 16 2012, Oct 14 2010

import Data.List (transpose)
a003602 = flip div 2 . (+ 1) . a000265
a003602_list = concat $ transpose [[1..], a003602_list]
-- Reinhard Zumkeller, Aug 09 2013, May 23 2013

A003602:=proc(n) options remember: if n mod 2 = 1 then RETURN((n+1)/2) else RETURN(procname(n/2)) fi: end proc:
seq(A003602(n), n=1..83); # Pab Ter
nmax := 83: for m from 0 to ceil(simplify(log[2](nmax))) do for k from 1 to ceil(nmax/(m+2)) do a((2*k-1)*2^m) := k od: od: seq(a(k), k=1..nmax); # Johannes W. Meijer, Feb 04 2013
A003602 := proc(n)
    a := 1;
    for p in ifactors(n)[2] do
        if op(1,p) > 2 then
            a := a*op(1,p)^op(2,p) ;
        end if;
    end do  :
    (a+1)/2 ;
end proc: # R. J. Mathar, May 19 2016

a[n_] := Block[{m = n}, While[ EvenQ@m, m /= 2]; (m + 1)/2]; Array[a, 84] (* or *)
a[1] = 1; a[n_] := a[n] = If[OddQ@n, (n + 1)/2, a[n/2]]; Array[a, 84] (* Robert G. Wilson v, May 23 2006 *)
a[n_] := Ceiling[NestWhile[Floor[#/2] &, n, EvenQ]/2]; Array[a, 84] (* Birkas Gyorgy, Apr 05 2011 *)
a003602 = {1}; max = 7; Do[b = {}; Do[AppendTo[b, {k, a003602[[k]]}], {k, Length[a003602]}]; a003602 = Flatten[b], {n, 2, max}]; a003602 (* L. Edson Jeffery, Nov 21 2015 *)

A003602(n)=(n/2^valuation(n,2)+1)/2; /* Joerg Arndt, Apr 06 2011 */

import math
def a(n): return (n/2**int(math.log(n - (n & n - 1), 2)) + 1)/2 # Indranil Ghosh, Apr 24 2017

def A003602(n): return (n>>(n&-n).bit_length())+1 # Chai Wah Wu, Jul 08 2022

(define (A003602 n) (let loop ((n n)) (if (even? n) (loop (/ n 2)) (/ (+ 1 n) 2)))) ;; Antti Karttunen, Feb 04 2015

a(n) = (A000265(n) + 1)/2.
a((2*k-1)*2^m) = k, for m >= 0 and k >= 1. - Robert G. Wilson v, May 23 2006
Inverse Weigh transform of A035528. - Christian G. Bower
G.f.: 1/x * Sum_{k>=0} x^2^k/(1-2*x^2^(k+1) + x^2^(k+2)). - Ralf Stephan, Jul 24 2003
a(2*n-1) = n and a(2*n) = a(n). - Pab Ter (pabrlos2(AT)yahoo.com), Oct 25 2005
a(A118413(n,k)) = A002024(n,k); = a(A118416(n,k)) = A002260(n,k); a(A014480(n)) = A001511(A014480(n)). - Reinhard Zumkeller, Apr 27 2006
Ordinal transform of A001511. - Franklin T. Adams-Watters, Aug 28 2006
a(n) = A249745(A126760(A003961(n))) = A249745(A253887(A048673(n))). That is, this sequence plays the same role for the numbers in array A135764 as A126760 does for the odd numbers in array A135765. - Antti Karttunen, Feb 04 2015 & Jan 19 2016
G.f. satisfies g(x) = g(x^2) + x/(1-x^2)^2. - Robert Israel, Apr 24 2015
a(n) = A181988(n)/A001511(n). - L. Edson Jeffery, Nov 21 2015
a(n) = A025480(n-1) + 1. - R. J. Mathar, May 19 2016
a(n) = A110963(2n-1) = A349135(4*n). - Antti Karttunen, Apr 18 2022
a(n) = (1 + n)/2, for n odd; a(n) = a(n/2), for n even. - David James Sycamore, Jul 28 2022
a(n) = n/2^A001511(n) + 1/2. - Alan Michael Gómez Calderón, Oct 06 2023
a(n) = A123390(A118319(n)). - Flávio V. Fernandes, Mar 02 2025

More terms from Pab Ter (pabrlos2(AT)yahoo.com), Oct 25 2005

A126760 a(0) = 0, a(2n) = a(n), a(3n) = a(n), a(6n+1) = 2n + 1, a(6n+5) = 2n + 2.

Original entry on oeis.org

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

Offset: 0

N. J. A. Sloane, Feb 19 2007

nonn

For further information see A126759, which provided the original motivation for this sequence.
From Antti Karttunen, Jan 28 2015: (Start)
The odd bisection of the sequence gives A253887, and the even bisection gives the sequence itself.
A254048 gives the sequence obtained when this sequence is restricted to A007494 (numbers congruent to 0 or 2 mod 3).
For all odd numbers k present in square array A135765, a(k) = the column index of k in that array. (End)
A322026 and this sequence (without the initial zero) are ordinal transforms of each other. - Antti Karttunen, Feb 09 2019
Also ordinal transform of A065331 (after the initial 0). - Antti Karttunen, Sep 08 2024

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

One less than A126759.
Cf. A003586, A003602, A007310, A064989, A249746, A253887, A254048, A273669, A322317, A323881 (Dirichlet inverse), A323882.
Cf. A347233 (Möbius transform) and also A349390, A349393, A349395 for other Dirichlet convolutions.
Ordinal transform of A065331 and of A322026 (after the initial 0).
Related arrays: A135765, A254102.

f[n_] := Block[{a}, a[0] = 0; a[1] = a[2] = a[3] = 1; a[x_] := Which[EvenQ@ x, a[x/2], Mod[x, 3] == 0, a[x/3], Mod[x, 6] == 1, 2 (x - 1)/6 + 1, Mod[x, 6] == 5, 2 (x - 5)/6 + 2]; Table[a@ i, {i, 0, n}]] (* Michael De Vlieger, Feb 03 2015 *)

A126760(n)={n&&n\=3^valuation(n,3)<M. F. Hasler, Jan 19 2016

a(n) = A126759(n)-1. [The original definition.]
From Antti Karttunen, Jan 28 2015: (Start)
a(0) = 0, a(2n) = a(n), a(3n) = a(n), a(6n+1) = 2n + 1, a(6n+5) = 2n + 2.
Or with the last clause represented in another way:
a(0) = 0, a(2n) = a(n), a(3n) = a(n), a(6n+1) = 2n + 1, a(6n-1) = 2n.
Other identities. For all n >= 1:
a(n) = A253887(A003602(n)).
a(6n-3) = a(4n-2) = a(2n-1) = A253887(n).
(End)
a(n) = A249746(A003602(A064989(n))). - Antti Karttunen, Feb 04 2015
a(n) = A323882(4*n). - Antti Karttunen, Apr 18 2022

Name replaced with an independent recurrence and the old description moved to the Formula section - Antti Karttunen, Jan 28 2015

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

Original entry on oeis.org

1, 3, 2, 5, 6, 4, 7, 10, 12, 8, 9, 14, 20, 24, 16, 11, 18, 28, 40, 48, 32, 13, 22, 36, 56, 80, 96, 64, 15, 26, 44, 72, 112, 160, 192, 128, 17, 30, 52, 88, 144, 224, 320, 384, 256, 19, 34, 60, 104, 176, 288, 448, 640, 768, 512, 21, 38, 68, 120, 208, 352, 576, 896, 1280, 1536, 1024, 23, 42, 76, 136, 240, 416, 704, 1152, 1792, 2560, 3072, 2048, 25, 46, 84, 152, 272, 480, 832, 1408, 2304, 3584, 5120, 6144, 4096, 27, 50, 92, 168, 304, 544, 960, 1664, 2816

Offset: 1

Alford Arnold, Nov 29 2007

The array in A135764 is identical to the array in A054582 [up to the transposition and different indexing. - Clark Kimberling, Dec 03 2010; comment amended by Antti Karttunen, Feb 03 2015; please see the illustration in Example section].
The array gives a bijection between the natural numbers N and N^2. A more usual bijection is to take the natural numbers A000027 and write them in the usual OEIS square array format. However this bijection has the advantage that it can be formed by iterating the usual bijection between N and 2N. - Joshua Zucker, Nov 04 2011
The array can be used to determine the configurations of k-th Towers of Hanoi moves, by labeling odd row terms C,B,A,C,B,A,... and even row terms B,C,A,B,C,A,.... Then given k equal to or greater than term "a" in each n-th row, but less than the next row term, record the label A, B, or C for term "a". This denotes the peg position for the disc corresponding to the n-th row. For example, with k = 25, five discs are in motion since the binary for 25 = 11001, five bits. We find that 25 in row 5 is greater than 16 labeled C, but less than 48. Thus, disc 5 is on peg C. In the 4th row, 25 is greater than 24 (a C), but less than 40, so goes onto the C peg. Similarly, disc 3 is on A, 2 is on A, and disc 1 is on A. Thus, discs 2 and 3 are on peg A, while 1, 4, and 5 are on peg C. - Gary W. Adamson, Jun 22 2012
Shares with arrays A253551 and A254053 the property that A001511(n) = k for all terms n on row k and when going downward in each column, terms grow by doubling. - Antti Karttunen, Feb 03 2015
Let P be the infinite palindromic word having initial word 0 and midword sequence (1,2,3,4,...) = A000027. Row n of the array A135764 gives the positions of n-1 in S. ("Infinite palindromic word" is defined at A260390.) - Clark Kimberling, Aug 13 2015
The probability distribution series 1 = 2/3 + 4/15 + 16/255 + 256/65535 + ... + A001146(n-1)/A051179(n) governs the proportions of terms in A001511 from row n of the array. In A001511(1..15) there are ((2/3) * 15) = ten terms from row one of the array, ((4/15) * 15) = four terms from row two, and ((16/255) * 15) = one (rounded), giving one term from row three (a 4). - Gary W. Adamson, Dec 16 2021
From Gary W. Adamson, Dec 30 2021: (Start)
Subarrays representing the number of divisors of an integer can be mapped on the table. For 60, write the odd divisors on the top row: 1, 3, 5, 15. Since 60 has 12 divisors, let the left column equal 1, 2, 4, where 4 is the highest power of 2 dividing 60. Multiplying top row terms by left column terms, we get the result:
  1   3   5  15
  2   6  10  30
  4  12  20  60. (End)

			The table begins
   1,  3,   5,   7,   9,  11,  13,  15,  17,  19,  21,  23, ...
   2,  6,  10,  14,  18,  22,  26,  30,  34,  38,  42,  46, ...
   4, 12,  20,  28,  36,  44,  52,  60,  68,  76,  84,  92, ...
   8, 24,  40,  56,  72,  88, 104, 120, 136, 152, 168, 184, ...
  16, 48,  80, 112, 144, 176, 208, 240, 272, 304, 336, 368, ...
  32, 96, 160, 224, 288, 352, 416, 480, 544, 608, 672, 736, ...
etc.
For n = 6, we have [A002260(6), A004736(6)] = [3, 1] (i.e., 6 corresponds to location 3,1 (row,col) in above table) and A(3,1) = A000079(3-1) * A005408(1-1) = 2^2 * 1 = 4.
For n = 13, we have [A002260(13), A004736(13)] = [3, 3] (13 corresponds to location 3,3 (row,col) in above table) and A(3,3) = A000079(3-1) * A005408(3-1) = 2^2 * 5 = 20.
For n = 23, we have [A002260(23), A004736(23)] = [2, 6] (23 corresponds to location 2,6) and A(2,6) = A000079(2-1) * A005408(6-1) = 2^1 * 11 = 22.

Transpose: A054582.
Inverse permutation: A249725.
Column 1: A000079.
Row 1: A005408.
Cf. A001511 (row index), A003602 (column index, both one-based).
Related arrays: A135765, A253551, A254053, A254055.
Cf. A000027, A002260, A004736, A064989, A135766, A249746.
Cf. also permutations A246675, A246676, A249741, A249811, A249812.
Cf. A260390.
Cf. A001146, A051179.

seq(seq(2^(j-1)*(2*(i-j)+1),j=1..i),i=1..20); # Robert Israel, Feb 03 2015

f[n_] := Block[{i, j}, {1}~Join~Flatten@ Last@ Reap@ For[j = 1, j <= n, For[i = j, i > 0, Sow[2^(j - i - 1)*(2 i + 1)], i--], j++]]; f@ 10 (* Michael De Vlieger, Feb 03 2015 *)

a(n) = {s = ceil((1 + sqrt(1 + 8*n)) / 2); r = n - binomial(s-1, 2) - 1;k = s - r - 2; 2^r * (2 * k + 1) } \\ David A. Corneth, Feb 05 2015

(define (A135764 n) (A135764bi (A002260 n) (A004736 n)))
(define (A135764bi row col) (* (A000079 (- row 1)) (+ -1 col col)))
;; Antti Karttunen, Feb 03 2015

From Antti Karttunen, Feb 03 2015: (Start)
A(row, col) = 2^(row-1) * ((2*col)-1) = A000079(row-1) * A005408(col-1).
A(row,col) = A064989(A135765(row,A249746(col))).
A(row,col) = A(row+1,col)/2 [discarding the topmost row and halving the rest of terms gives the array back].
A(row,col) = A(row,col+1) - A000079(row) [discarding the leftmost column and subtracting 2^{row number} from the rest of terms gives the array back].
(End)
G.f.: ((2*x+1)*Sum_{i>=0} 2^i*x^(i*(i+1)/2) + 2*(1-2*x)*Sum_{i>=0} i*x^(i*(i+1)/2) + (1-6*x)*Sum_{i>=0} x^(i*(i+1)/2) - 1 - 2*x)*x/(1-2*x)^2. These sums are related to Jacobi theta functions. - Robert Israel, Feb 03 2015

More terms from Sean A. Irvine, Nov 23 2010

Name amended and the illustration of array in the example section transposed by Antti Karttunen, Feb 03 2015

A254051 Square array A by downward antidiagonals: A(n,k) = (3 + 3^n(2floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...

Original entry on oeis.org

1, 3, 2, 4, 8, 5, 6, 11, 23, 14, 7, 17, 32, 68, 41, 9, 20, 50, 95, 203, 122, 10, 26, 59, 149, 284, 608, 365, 12, 29, 77, 176, 446, 851, 1823, 1094, 13, 35, 86, 230, 527, 1337, 2552, 5468, 3281, 15, 38, 104, 257, 689, 1580, 4010, 7655, 16403, 9842, 16, 44, 113, 311, 770, 2066, 4739, 12029, 22964, 49208, 29525, 18, 47

Offset: 1

L. Edson Jeffery & Antti Karttunen, Jan 24 2015

This is transposed dispersion of (3n-1), starting from its complement A032766 as the first row of square array A(row,col). Please see the transposed array A191450 for references and background discussion about dispersions.

For any odd number x = A135765(row,col), the result after one combined Collatz step (3x+1)/2 -> x (A165355) is found in this array at A(row+1,col).

			The top left corner of the array:
   1,   3,   4,   6,   7,   9,  10,  12,   13,   15,   16,   18,   19,   21
   2,   8,  11,  17,  20,  26,  29,  35,   38,   44,   47,   53,   56,   62
   5,  23,  32,  50,  59,  77,  86, 104,  113,  131,  140,  158,  167,  185
  14,  68,  95, 149, 176, 230, 257, 311,  338,  392,  419,  473,  500,  554
  41, 203, 284, 446, 527, 689, 770, 932, 1013, 1175, 1256, 1418, 1499, 1661
...

Inverse: A254052.
Transpose: A191450.
Row 1: A032766.
Cf. A007051, A057198, A199109, A199113 (columns 1-4).
Cf. A254046 (row index of n in this array, see also A253786), A253887 (column index).
Array A135765(n,k) = 2*A(n,k) - 1.
Other related arrays: A254055, A254101, A254102.
Cf. also A000079, A000244, A003961, A007310, A032766, A002260, A004736, A038722, A165355, A254050.
Related permutations: A048673, A254053, A183209, A249745, A254103, A254104.

In A(n,k)-formulas below, n is the row, and k the column index, both starting from 1:
A(n,k) = (3 + ( A000244(n) * (2*A032766(k) - 1) )) / 6. - Antti Karttunen after L. Edson Jeffery's direct formula for A191450, Jan 24 2015
A(n,k) = A048673(A254053(n,k)). [Alternative formula.]
A(n,k) = (1/2) * (1 + A003961((2^(n-1)) * A254050(k))). [The above expands to this.]
A(n,k) = (1/2) * (1 + (A000244(n-1) * A007310(k))). [Which further reduces to this, equivalent to L. Edson Jeffery's original formula above.]
A(1,k) = A032766(k) and for n > 1: A(n,k) = (3 * A254051(n-1,k)) - 1. [The definition of transposed dispersion of (3n-1).]
A(n,k) = (1+A135765(n,k))/2, or when expressed one-dimensionally, a(n) = (1+A135765(n))/2.
A(n+1,k) = A165355(A135765(n,k)).
As a composition of related permutations. All sequences interpreted as one-dimensional:
a(n) = A048673(A254053(n)). [Proved above.]
a(n) = A191450(A038722(n)). [Transpose of array A191450.]

A254053 Square array: A(row,col) = 2^(row-1) * ((2*A249745(col))-1) = A064216(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, 3, 2, 5, 6, 4, 7, 10, 12, 8, 11, 14, 20, 24, 16, 13, 22, 28, 40, 48, 32, 17, 26, 44, 56, 80, 96, 64, 19, 34, 52, 88, 112, 160, 192, 128, 9, 38, 68, 104, 176, 224, 320, 384, 256, 23, 18, 76, 136, 208, 352, 448, 640, 768, 512, 29, 46, 36, 152, 272, 416, 704, 896, 1280, 1536, 1024, 15, 58, 92, 72, 304, 544, 832, 1408, 1792, 2560, 3072, 2048, 31, 30

Offset: 1

Antti Karttunen, Jan 24 2015

Shares with A135764 and A253551 the property that A001511(n) = k for all terms n on row k and when going downward in each column, terms grow by doubling.

			The top left corner of the array:
   1,  3,  5,   7,  11,  13,  17,  19,   9,  23,  29,  15,  31,  37,  41,  43,
   2,  6, 10,  14,  22,  26,  34,  38,  18,  46,  58,  30,  62,  74,  82,  86,
   4, 12, 20,  28,  44,  52,  68,  76,  36,  92, 116,  60, 124, 148, 164, 172,
   8, 24, 40,  56,  88, 104, 136, 152,  72, 184, 232, 120, 248, 296, 328, 344,
  16, 48, 80, 112, 176, 208, 272, 304, 144, 368, 464, 240, 496, 592, 656, 688,
...

Inverse: A254054.
Similar or related permutations: A135764, A253551, A064216, A254051.
Cf. A000079, A001511, A002260, A004736, A064989, A135765, A249745, A254049, A254050.

A(row,col) = A135764(row, A249745(col)). [Is otherwise the same array as A135764, but the column positions have been permuted by A249745.]
A(row,col) = 2^(row-1) * ((2*A249745(col))-1) = 2^(row-1) * A254050(col). [The above expands to this.]
a(n) = A064989(A135765(n)).
As a composition of other permutations:
a(n) = A064216(A254051(n)). [As an array: A(row,col) = A064216(A254051(row,col)).]

A254102 Square array A(row,col) = A253887(A254055(row,col)) = A126760(A254101(row,col)).

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 4, 8, 3, 3, 6, 1, 6, 14, 1, 2, 9, 32, 68, 21, 2, 5, 20, 50, 24, 7, 122, 1, 10, 26, 4, 75, 284, 608, 183, 5, 12, 15, 39, 176, 446, 107, 456, 1094, 2, 7, 5, 86, 230, 132, 669, 2552, 5468, 1641, 1, 4, 38, 104, 129, 345, 1580, 4010, 1914, 2051, 9842

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 A135764(1,A254055(row+1,col)).
What the resulting odd number will be, is given by A254101(row+1,col) =  A000265(A254051(row+1,col)).
That number's column index in array A135765 is then given by A(row+1,col).

			The top left corner of the array:
     1,    1,    1,    1,     3,     1,     2,    1,     5,     2,     1,
     1,    1,    4,    6,     2,     5,    10,   12,     7,     4,    16,
     2,    8,    1,    9,    20,    26,    15,    5,    38,    44,    12,
     3,    6,   32,   50,     4,    39,    86,  104,    57,    17,   140,
    14,   68,   24,   75,   176,   230,   129,   78,   338,   392,    53,
    21,    7,  284,  446,   132,   345,   770,  932,   507,   294,  1256,
   122,  608,  107,  669,  1580,  2066,  1155,   44,  3038,  3524,   942,
   183,  456, 2552, 4010,   593,  3099,  6926, 8384,  4557,   331, 11300,
  1094, 5468, 1914, 6015, 14216, 18590, 10389, 6288, 27338, 31712,   530,
etc.

Cf. A000265, A126760, A253887, A254048.

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

(define (A254102 n) (A254102bi (A002260 n) (A004736 n)))
;; In turn using either one of these three bivariate functions:
(define (A254102 n) (A254102bi (A002260 n) (A004736 n)))
(define (A254102bi row col) (A126760 (A254051bi row col)))
(define (A254102bi row col) (A253887 (A254055bi row col)))
(define (A254102bi row col) (A126760 (A254101bi row col)))

A(row,col) = A126760(A254051(row,col)) = A126760(A254101(row,col)).
A(row,col) = A253887(A254055(row,col)).
A(row+1,col) = A254048(A135765(row,col)).

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.

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

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.

cp's OEIS Frontend

A003602 Kimberling's paraphrases: if n = (2k-1)*2^m then a(n) = k.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Haskell

Maple

Mathematica

PARI

Python

Python

Scheme

Formula

Extensions

A126760 a(0) = 0, a(2n) = a(n), a(3n) = a(n), a(6n+1) = 2n + 1, a(6n+5) = 2n + 2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Scheme

Formula

Extensions

A254051 Square array A by downward antidiagonals: A(n,k) = (3 + 3^n*(2*floor(3*k/2) - 1))/6, n,k >= 1; read as 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

Formula

A254053 Square array: A(row,col) = 2^(row-1) * ((2*A249745(col))-1) = A064216(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

Formula

A254102 Square array A(row,col) = A253887(A254055(row,col)) = A126760(A254101(row,col)).

Views

Author

Keywords

Comments

Examples

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

A254051 Square array A by downward antidiagonals: A(n,k) = (3 + 3^n(2floor(3*k/2) - 1))/6, n,k >= 1; read as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), ...