This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A361401 #15 Mar 15 2023 16:27:42 %S A361401 0,1,3,2,4,6,10,12,3,7,15,4,8,12,16,20,24,36,40,48,5,9,11,13,19,21,25, %T A361401 27,43,45,51,53,6,12,14,26,28,30,54,58,60,7,15,31,63,8,16,24,32,40,48, %U A361401 64,72,80,96,136,144,160,192 %N A361401 Irregular table T(n, k), n >= 0, k = 1..A361398(n); the n-th row lists the numbers whose binary expansion is a self-infiltration of that of n. %C A361401 See A361398 for the definition of an infiltration (a self-infiltration is an infiltration a of word with itself). %C A361401 The terms of the n-th row of A358893 appear in the n-th row of the present table (they correspond to terms with twice as many binary digits as n). %H A361401 Rémy Sigrist, <a href="/A361401/b361401.txt">Table of n, a(n) for n = 0..10102</a> (rows for n = 0..82 flattened) %H A361401 Rémy Sigrist, <a href="/A361401/a361401.gp.txt">PARI program</a> %H A361401 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A361401 T(n, 1) = 1. %F A361401 T(n, A361398(n)) = A330941(n). %e A361401 Table T(n, k) begins: %e A361401 n n-th row %e A361401 - --------------------------------------------------------- %e A361401 0 0 %e A361401 1 1, 3 %e A361401 2 2, 4, 6, 10, 12 %e A361401 3 3, 7, 15 %e A361401 4 4, 8, 12, 16, 20, 24, 36, 40, 48 %e A361401 5 5, 9, 11, 13, 19, 21, 25, 27, 43, 45, 51, 53 %e A361401 6 6, 12, 14, 26, 28, 30, 54, 58, 60 %e A361401 7 7, 15, 31, 63 %e A361401 8 8, 16, 24, 32, 40, 48, 64, 72, 80, 96, 136, 144, 160, 192 %o A361401 (PARI) See Links section. %Y A361401 Cf. A330941, A358893, A361398. %K A361401 nonn,base,tabf %O A361401 0,3 %A A361401 _Rémy Sigrist_, Mar 10 2023