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.

A255554 Permutation of natural numbers: a(n) = A083221(A255552(n)).

This page as a plain text file.
%I A255554 #10 Feb 28 2015 14:49:51
%S A255554 1,2,3,4,9,6,5,8,7,10,15,12,11,14,13,16,21,18,25,20,17,22,27,24,19,26,
%T A255554 49,28,33,30,23,32,29,34,39,36,31,38,35,40,45,42,37,44,121,46,51,48,
%U A255554 41,50,43,52,57,54,169,56,77,58,63,60,55,62,47,64,69,66,53,68,59,70,75,72,61,74,67,76,81,78,71,80,65,82,87,84,289,86,73,88,93,90,91,92,79
%N A255554 Permutation of natural numbers: a(n) = A083221(A255552(n)).
%C A255554 a(n) tells which number in array A083221, constructed from the sieve of Eratosthenes is at the same position where n is in array A255551 constructed from Lucky sieve. As both arrays have A005843 (even numbers) as their topmost row, this permutation fixes all of them.
%H A255554 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A255554 a(n) = A083221(A255552(n)).
%F A255554 Other identities:
%F A255554 a(2n) = 2n. [Fixes even numbers.]
%F A255554 For all n >= 1, a(A255550(n)) = A083141(n).
%F A255554 For all n >= 2, a(A000959(n)) = A000040(n).
%F A255554 For all n >= 2, a(A219178(n)) = A001248(n).
%o A255554 (Scheme) (define (A255554 n) (A083221 (A255552 n)))
%Y A255554 Inverse: A255553.
%Y A255554 Similar permutations: A255407, A255408, A249817, A249818.
%Y A255554 Cf. A000040, A000959, A001248, A219178, A083141, A083221, A255550, A255552.
%K A255554 nonn
%O A255554 1,2
%A A255554 _Antti Karttunen_, Feb 26 2015