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.

A230432 Simple self-inverse permutation of natural numbers: after zero, list each block of A219661(n) numbers in reverse order, from A226061(n+1) to A219665(n).

This page as a plain text file.
%I A230432 #9 Oct 30 2013 11:51:58
%S A230432 0,1,3,2,8,7,6,5,4,27,26,25,24,23,22,21,20,19,18,17,16,15,14,13,12,11,
%T A230432 10,9,110,109,108,107,106,105,104,103,102,101,100,99,98,97,96,95,94,
%U A230432 93,92,91,90,89,88,87,86,85,84,83,82,81,80,79,78,77,76,75,74,73
%N A230432 Simple self-inverse permutation of natural numbers: after zero, list each block of A219661(n) numbers in reverse order, from A226061(n+1) to A219665(n).
%C A230432 This permutation can be used to map between the sequences A219666 and A230416. E.g. A219666(n) = A230416(a(n)) and vice versa: A230416(n) = A219666(a(n)).
%H A230432 Antti Karttunen, <a href="/A230432/b230432.txt">Table of n, a(n) for n = 0..3149</a>
%H A230432 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A230432 a(n) = A219665(A230411(n+1)) - A230431(n) - 1.
%o A230432 (Scheme)
%o A230432 (define (A230432 n) (if (zero? n) n (- (A219665 (A230411 (+ 1 n))) (A230431 n) 1)))
%Y A230432 Cf. A219661, A219665, A226061, A230411, A219666, A230416, A230431.
%Y A230432 Analogous sequence for binary system: A218602.
%K A230432 nonn
%O A230432 0,3
%A A230432 _Antti Karttunen_, Oct 22 2013