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.

A275848 Permutation of natural numbers: a(0) = 0, a(A255411(n)) = A153880(a(n)), a(A256450(n)) = A273670(n).

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