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 A275847 #11 Aug 15 2016 04:29:55 %S A275847 0,1,4,2,3,5,18,6,12,7,8,9,16,10,22,11,13,14,15,17,19,20,21,23,96,24, %T A275847 48,25,26,27,72,28,52,29,30,31,60,32,64,33,34,35,36,37,38,39,40,41,90, %U A275847 42,66,43,44,45,114,46,70,47,49,50,76,51,84,53,54,55,56,57,58,59,61,62,88,63,94,65,67,68,100,69,108,71,73,74,112,75,118,77,78 %N A275847 Permutation of natural numbers: a(0) = 0, a(A153880(n)) = A255411(a(n)), a(A273670(n)) = A256450(n). %H A275847 Antti Karttunen, <a href="/A275847/b275847.txt">Table of n, a(n) for n = 0..5039</a> %H A275847 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %H A275847 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A275847 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(A273663(n)). %o A275847 (Scheme, with memoization-macro definec) %o A275847 (definec (A275847 n) (cond ((zero? n) n) ((zero? (A257680 (A225901 n))) (A255411 (A275847 (A266193 n)))) (else (A256450 (A273663 n))))) %Y A275847 Inverse: A275848. %Y A275847 Cf. A153880, A225901, A255411, A256450, A257680, A266193, A273663, A273670. %Y A275847 Similar permutations: A273667 (a more recursed variant), A275845, A275846. %K A275847 nonn,base,look %O A275847 0,3 %A A275847 _Antti Karttunen_, Aug 13 2016