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 A357491 #12 Oct 02 2022 10:53:14 %S A357491 0,1,2,3,4,5,6,7,8,9,10,12,11,13,14,15,16,17,18,21,19,22,24,26,20,23, %T A357491 25,28,27,29,30,31,32,33,34,38,35,39,42,45,36,40,43,48,46,50,52,54,37, %U A357491 41,44,49,56,47,51,57,53,58,55,60,59,61,62,63,64,65,66,71 %N A357491 Distinct values in A356784, in order of appearance. %C A357491 We use offset 0 so as to have a permutation of the nonnegative integers. %C A357491 See A357492 for the inverse. %H A357491 Rémy Sigrist, <a href="/A357491/b357491.txt">Table of n, a(n) for n = 0..8191</a> %H A357491 Rémy Sigrist, <a href="/A357491/a357491.png">Scatterplot of the first 2^21 terms</a> %H A357491 Rémy Sigrist, <a href="/A357491/a357491.txt">C++ program</a> %H A357491 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A357491 a(n) <= 2^k iff n <= 2^k for any k >= 0. %F A357491 a(2^k) = 2^k for any k >= 0. %e A357491 Table A357492 begins: %e A357491 0, %e A357491 0, %e A357491 0, 1, %e A357491 0, 1, 2, 3, %e A357491 0, 1, 2, 4, 3, 5, 6, 7, %e A357491 0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 7, 12, 11, 13, 14, 15, %e A357491 ... %e A357491 So the present sequence begins: %e A357491 0, %e A357491 1, %e A357491 2, 3, %e A357491 4, 5, 6, 7, %e A357491 8, 9, 10, 12, 11, 13, 14, 15, %e A357491 ... %o A357491 (C++) See Links section. %Y A357491 Cf. A356784, A357492 (inverse). %K A357491 nonn %O A357491 0,3 %A A357491 _Rémy Sigrist_, Oct 01 2022