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 A269367 #8 Feb 28 2016 07:59:34 %S A269367 1,2,3,5,4,7,9,11,6,8,12,17,13,10,21,23,19,14,18,16,28,20,15,35,30,41, %T A269367 24,39,27,22,42,25,36,26,47,40,29,34,32,33,37,55,38,51,49,43,59,67,57, %U A269367 68,58,69,64,65,75,119,76,66,74,52,46,44,50,87,90,56,71,111,45,85,60,72,54,77,104,79,99,88,95,48,53,78,102,82,31 %N A269367 Suspected permutation of natural numbers: a(n) = A255070(A269363(n)). %C A269367 Lexicographically first injection of natural numbers beginning with a(1)=1 such that for all n >= 1, A091067(a(n))*A091067(a(n+1)) is a fibbinary number (A003714), i.e., has no adjacent 1's in its base-2 representation. %H A269367 Antti Karttunen, <a href="/A269367/b269367.txt">Table of n, a(n) for n = 1..13217</a> %H A269367 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A269367 a(n) = A255070(A269363(n)). %o A269367 (Scheme, with defineperm1-macro from _Antti Karttunen_'s IntSeq-library) %o A269367 (defineperm1 (A269367 n) (A255070 (A269363 n))) %o A269367 (define (A269368 n) (A269367 (- n))) ;; This returns inverse values of A269367 from its hidden cache. %Y A269367 Left inverse: A269368 (also the right inverse if this is a permutation of natural numbers). %Y A269367 Cf. A003714, A091067, A266121, A269361, A269363, A255070. %K A269367 nonn,base %O A269367 1,2 %A A269367 _Antti Karttunen_, Feb 27 2016