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 A361399 #17 Mar 15 2023 16:27:48 %S A361399 0,1,2,1,2,5,2,3,4,5,2,5,2,5,6,3,4,9,10,5,4,5,10,11,4,5,6,5,6,13,6,7, %T A361399 8,9,18,9,4,9,10,11,4,9,10,5,10,5,22,11,4,9,10,5,10,5,6,11,12,13,6,13, %U A361399 6,13,14,7,8,17,18,9,18,9,18,19,8,9,10,19,10,21 %N A361399 a(n) is the least k such that the binary expansion of n is a self-infiltration of that of k. %C A361399 See A361398 for the definition of an infiltration (a self-infiltration is an infiltration a of word with itself). %C A361399 a(n) is the index of the first row of A361401 containing n. %H A361399 Rémy Sigrist, <a href="/A361399/b361399.txt">Table of n, a(n) for n = 0..8192</a> %H A361399 Rémy Sigrist, <a href="/A361399/a361399.png">Colored log-log scatterplot of the first 2^20 terms</a> (the color is function of A070939(a(n)) - A070939(n)) %H A361399 Rémy Sigrist, <a href="/A361399/a361399.gp.txt">PARI program</a> %H A361399 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A361399 a(n) <= n. %F A361399 a(A020330(n)) = n. %o A361399 (PARI) See Links section. %Y A361399 Cf. A020330, A070939, A361398, A361401. %K A361399 nonn,base %O A361399 0,3 %A A361399 _Rémy Sigrist_, Mar 10 2023