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 A300868 #14 Aug 22 2021 13:17:50 %S A300868 1,2,3,4,8,6,12,5,9,13,15,7,10,19,11,16,17,18,14,26,32,24,23,22,41,20, %T A300868 38,39,36,43,44,21,33,34,59,29,64,27,28,52,25,49,30,31,53,46,47,48,42, %U A300868 82,51,40,45,76,96,78,72,73,35,71,84,75,86,37,65,66,70 %N A300868 Lexicographically earliest sequence of distinct positive terms such that, for any n > 0, n * a(n) is a Fibbinary number (A003714). %C A300868 This sequence is a self-inverse permutation of the natural numbers. %H A300868 Rémy Sigrist, <a href="/A300868/b300868.txt">Table of n, a(n) for n = 1..10000</a> %H A300868 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %H A300868 Rémy Sigrist, <a href="/A300868/a300868.png">Colored logarithmic scatterplot of the first 2^15 terms</a> (where the color is function of A070939(n * a(n))) %H A300868 Rémy Sigrist, <a href="/A300868/a300868.txt">C++ program for A300868</a> %e A300868 The first terms, alongside the binary representation of n * a(n), are: %e A300868 n a(n) binary(n * a(n)) %e A300868 -- ---- ---------------- %e A300868 1 1 1 %e A300868 2 2 100 %e A300868 3 3 1001 %e A300868 4 4 10000 %e A300868 5 8 101000 %e A300868 6 6 100100 %e A300868 7 12 1010100 %e A300868 8 5 101000 %e A300868 9 9 1010001 %e A300868 10 13 10000010 %e A300868 11 15 10100101 %e A300868 12 7 1010100 %e A300868 13 10 10000010 %e A300868 14 19 100001010 %e A300868 15 11 10100101 %e A300868 16 16 100000000 %e A300868 17 17 100100001 %e A300868 18 18 101000100 %e A300868 19 14 100001010 %e A300868 20 26 1000001000 %o A300868 (C++) See Links section. %Y A300868 Cf. A003714, A070939. %K A300868 nonn,look,base %O A300868 1,2 %A A300868 _Rémy Sigrist_, Mar 14 2018