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.
%I A305293 #13 Jun 01 2018 21:40:58 %S A305293 1,5,6,11,10,24,39,22,15,14,25,69,21,20,53,130,76,51,29,28,54,112,97, %T A305293 50,78,96,34,33,84,209,232,38,37,85,153,44,43,111,156,179,109,58,57, %U A305293 142,383,140,148,352,281,124,249,299,93,118,218,62,61,143,172,68,67,173,641,696,162,75,74,210,227,238,191,535,82,81 %N A305293 Prime shift towards larger primes, conjugated by the EKG-permutation: a(n) = A064664(A003961(A064413(n))). %C A305293 Permutation of A064957. %H A305293 Antti Karttunen, <a href="/A305293/b305293.txt">Table of n, a(n) for n = 1..11856</a> %H A305293 <a href="/index/Ed#EKG">Index entries for sequences related to EKG sequence</a> %H A305293 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %F A305293 a(n) = A064664(A003961(A064413(n))). %F A305293 Other identities. For all n >= 1: %F A305293 A305294(a(n)) = n. %F A305293 a(A064955(n)) = A064955(1+n). %F A305293 For all n >= 2, a(A064423(n)) = 1+A064955(1+n). %Y A305293 Cf. A305294 (a left inverse). %Y A305293 Cf. A003961, A064413, A064423, A064664, A064955, A064957. %K A305293 nonn %O A305293 1,2 %A A305293 _Antti Karttunen_, May 31 2018