cp's OEIS Frontend

A341220 Irregular table read by rows T(n, k), n >= 0, k = 1..A341218(n); T(n, k) is the k-th number m such that A340873(m) = n.

%I A341220 #18 Mar 07 2021 20:56:58
%S A341220 1,2,4,3,8,6,7,16,12,14,15,32,5,24,28,30,31,64,10,11,48,56,60,62,63,
%T A341220 128,20,21,22,23,96,112,120,124,126,127,256,13,40,42,43,44,46,47,192,
%U A341220 224,240,248,252,254,255,512,25,26,27,80,84,85,86,87,88,92,94,95,384,448,480,496,504,508,510,511,1024
%N A341220 Irregular table read by rows T(n, k), n >= 0, k = 1..A341218(n); T(n, k) is the k-th number m such that A340873(m) = n.
%C A341220 Each positive integer appears once.
%C A341220 For any n >= 0:
%C A341220 - if m appears in row n, then 2*m appears in row n+1,
%C A341220 - if m appears in row n and is an odious even number > 2, then an additional odd number appears in row n+1.
%H A341220 Rémy Sigrist, <a href="/A341220/b341220.txt">Table of n, a(n) for n = 0..11792</a> (rows 0..26)
%H A341220 Rémy Sigrist, <a href="/A341220/a341220.gp.txt">PARI program for A341220</a>
%H A341220 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%H A341220 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A341220 T(n, 1) = A341194(n).
%F A341220 T(n, A341218(n)) = 2^n.
%e A341220 Table begins:
%e A341220     1;
%e A341220     2;
%e A341220     4;
%e A341220     3, 8;
%e A341220     6, 7, 16;
%e A341220     12, 14, 15, 32;
%e A341220     5, 24, 28, 30, 31, 64;
%e A341220     10, 11, 48, 56, 60, 62, 63, 128;
%e A341220     20, 21, 22, 23, 96, 112, 120, 124, 126, 127, 256;
%e A341220     13, 40, 42, 43, 44, 46, 47, 192, 224, 240, 248, 252, 254, 255, 512;
%e A341220     ...
%o A341220 (PARI) See Links section.
%Y A341220 Cf. A127824, A340873, A341194, A341218.
%K A341220 nonn,look,base,tabf
%O A341220 0,2
%A A341220 _Rémy Sigrist_, Feb 07 2021