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