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.

A279343 a(1) = 0, and for n > 1, if A079559(n) = 0, a(n) = 1 + 2*a(A256992(n)), otherwise a(n) = 2*a(A256992(n)).

This page as a plain text file.
%I A279343 #10 Dec 12 2016 09:12:55
%S A279343 0,1,2,4,3,5,8,6,9,10,16,7,11,17,12,18,13,20,32,19,21,14,22,33,34,24,
%T A279343 15,23,35,25,36,26,37,40,64,27,41,38,42,65,28,44,39,43,29,66,68,45,48,
%U A279343 30,67,69,46,70,49,50,72,31,47,71,51,73,52,74,53,80,128,75,81,54,82,129,76,84,55,83,77,130,56,85,88,78,131,57,86
%N A279343 a(1) = 0, and for n > 1, if A079559(n) = 0, a(n) = 1 + 2*a(A256992(n)), otherwise a(n) = 2*a(A256992(n)).
%C A279343 Note the indexing: the domain starts from 1, while the range includes also zero.
%H A279343 Antti Karttunen, <a href="/A279343/b279343.txt">Table of n, a(n) for n = 1..8192</a>
%H A279343 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A279343 a(1) = 0, and for n > 1, if A079559(n) = 0 [when n is a term of A055938], a(n) = 1 + 2*a(A256992(n)), otherwise a(n) = 2*a(A256992(n)).
%F A279343 As a composition of other permutations:
%F A279343 a(n) = A054429(A279341(n)).
%F A279343 a(n) = A279341(A279347(n)).
%F A279343 a(n) = A156552(A279338(n)).
%F A279343 Other identities. For all n >= 1:
%F A279343 A000120(a(n)) = A279346(n).
%F A279343 For all n >= 2, A070939(a(n)) = A256993(n).
%o A279343 (Scheme) (definec (A279343 n) (cond ((= 1 n) 0) ((zero? (A079559 n)) (+ 1 (* 2 (A279343 (A256992 n))))) (else (* 2 (A279343 (A256992 n))))))
%Y A279343 Inverse: A279344.
%Y A279343 Cf. A000120, A070939, A079559, A256992, A256993, A279346.
%Y A279343 Related or similar permutations: A054429, A156552, A279338, A279341, A279347.
%K A279343 nonn
%O A279343 1,3
%A A279343 _Antti Karttunen_, Dec 10 2016