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 A273667 #12 Jun 25 2017 03:12:32 %S A273667 0,1,4,2,6,3,18,8,12,5,24,10,48,15,16,7,30,13,56,20,21,9,36,17,96,67, %T A273667 60,26,27,11,72,42,22,23,120,81,240,73,66,32,33,14,87,49,28,29,144, %U A273667 101,360,270,88,89,80,38,90,39,52,19,107,57,288,34,76,35,168,125,416,303,109,110,99,44,420,111,108,45,61,25,112,131,64,68,327,40 %N A273667 Permutation of nonnegative integers: a(0) = 0, a(A153880(n)) = A255411(a(n)), a(A273670(n)) = A256450(a(n)). %H A273667 Antti Karttunen, <a href="/A273667/b273667.txt">Table of n, a(n) for n = 0..5039</a> %H A273667 Indranil Ghosh, <a href="/A273667/a273667.txt">Python program for computing this sequence</a> %H A273667 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %H A273667 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A273667 a(0) = 0; for n >= 1: if A257680(A225901(n)) = 0 [when n is one of the terms of A153880] then a(n) = A255411(a(A266193(n))), otherwise [when n is one of the terms of A273670], a(n) = A256450(a(A273663(n))). %F A273667 As a composition of other permutations: %F A273667 a(n) = A255566(A273665(n)). %o A273667 (Scheme, with memoization-macro definec) %o A273667 (definec (A273667 n) (cond ((zero? n) n) ((zero? (A257680 (A225901 n))) (A255411 (A273667 (A266193 n)))) (else (A256450 (A273667 (A273663 n)))))) %Y A273667 Inverse: A273668. %Y A273667 Cf. A153880, A225901, A255411, A256450, A257680, A266193, A273663, A273670. %Y A273667 Similar or related permutations: A255566, A273665. %K A273667 nonn,base %O A273667 0,3 %A A273667 _Antti Karttunen_, May 30 2016