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.

A225040 a(n) is the position of prime(n) in A225039, and a(n)=0, if prime(n) is not in A225039.

This page as a plain text file.
%I A225040 #11 May 03 2013 13:31:36
%S A225040 1,2,3,4,6,5,9,7,8,10,13,15,16,28,50,20,11,12,14,69,66,17,19,18,32,86,
%T A225040 21,64,22,38,26,74,23,41,24,25,71,89,27,49,84,33,30,35,34,31,29,175,
%U A225040 96,60,39,181,36,110,40,46,37,68,138,119,45,44,139,42,73,43
%N A225040 a(n) is the position of prime(n) in A225039, and a(n)=0, if prime(n) is not in A225039.
%C A225040 Conjecture: All terms are positive, or equivalently, the sequence is a permutation of the positive integers.
%H A225040 Peter J. C. Moses, <a href="/A225040/b225040.txt">Table of n, a(n) for n = 1..1600</a>
%t A225040 a={}; n=1; While[(tmp=Position[A225039, Prime[n]]) != {}, AppendTo[a,tmp]; n++]; Flatten[a] (* _Peter J. C. Moses_, Apr 25 2013 *)
%Y A225040 Cf. A225017, A225039.
%K A225040 nonn
%O A225040 1,2
%A A225040 _Vladimir Shevelev_, Apr 25 2013