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.

A332807 a(n) = A000720(A108546(n)).

This page as a plain text file.
%I A332807 #7 Feb 27 2020 22:48:53
%S A332807 1,2,3,4,6,5,7,8,10,9,12,11,13,14,16,15,18,17,21,19,24,20,25,22,26,23,
%T A332807 29,27,30,28,33,31,35,32,37,34,40,36,42,38,44,39,45,41,50,43,51,46,53,
%U A332807 47,55,48,57,49,59,52,60,54,62,56,65,58,66,61,68,63,70,64,71,67,74,69,77,72,78,73,79,75,80,76,82,81,84,83,87,85,88,86
%N A332807 a(n) = A000720(A108546(n)).
%H A332807 Antti Karttunen, <a href="/A332807/b332807.txt">Table of n, a(n) for n = 1..50507</a>
%H A332807 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A332807 a(n) = A000720(A108546(n)).
%o A332807 (PARI)
%o A332807 up_to = 50507;
%o A332807 A332807list(up_to) = { my(v=vector(up_to), p,q); v[1] = 2; v[2] = 3; v[3] = 5; for(n=4,up_to, p = v[n-2]; q = nextprime(1+p); while(q%4 != p%4, q=nextprime(1+q)); v[n] = q); apply(primepi,v); };
%o A332807 v332807 = A332807list(up_to);
%o A332807 A332807(n) = v332807[n];
%Y A332807 Cf. A332805 (inverse permutation).
%Y A332807 Fixed points are given by A000720(A108547(n)), n>=1.
%Y A332807 Cf. A000720, A108546.
%Y A332807 Cf. also A267100.
%K A332807 nonn
%O A332807 1,2
%A A332807 _Antti Karttunen_, Feb 27 2020