cp's OEIS Frontend

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.

A273668 Permutation of nonnegative integers: a(0) = 0, a(A255411(n)) = A153880(a(n)), a(A256450(n)) = A273670(a(n)).

This page as a plain text file.
%I A273668 #8 May 30 2016 18:25:24
%S A273668 0,1,3,5,2,9,4,15,7,21,11,29,8,17,41,13,14,23,6,57,19,20,32,33,10,77,
%T A273668 27,28,44,45,16,101,39,40,61,63,22,129,53,55,83,87,31,165,71,75,107,
%U A273668 111,12,43,213,95,56,99,137,141,18,59,269,119,26,76,125,177,80,183,38,25,81,341,134,153,30,37,100,161,62,225,104,231,52,35
%N A273668 Permutation of nonnegative integers: a(0) = 0, a(A255411(n)) = A153880(a(n)), a(A256450(n)) = A273670(a(n)).
%H A273668 Antti Karttunen, <a href="/A273668/b273668.txt">Table of n, a(n) for n = 0..5039</a>
%H A273668 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a>
%H A273668 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A273668 a(0) = 0; for n >= 1: if A257680(n) = 0 [when n is one of the terms of A255411] then a(n) = A153880(a(A257684(n))), otherwise [when n is one of the terms of A256450], a(n) = A273670(a(A273662(n))).
%F A273668 As a composition of other permutations:
%F A273668 a(n) = A273666(A255565(n)).
%o A273668 (Scheme, with memoization-macro definec)
%o A273668 (definec (A273668 n) (cond ((zero? n) n) ((zero? (A257680 n)) (A153880 (A273668 (A257684 n)))) (else (A273670 (A273668 (A273662 n))))))
%Y A273668 Inverse: A273667.
%Y A273668 Cf. A153880, A255411, A256450, A257680, A257684, A273662, A273670.
%Y A273668 Similar or related permutations: A255565, A273666.
%K A273668 nonn,base
%O A273668 0,3
%A A273668 _Antti Karttunen_, May 30 2016