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.

A341632 Primes in A073837.

This page as a plain text file.
%I A341632 #7 Feb 17 2021 15:06:23
%S A341632 5,31,41,59,139,281,281,281,311,479,593,1153,1153,1283,1559,1559,2213,
%T A341632 2213,2213,3167,3167,2963,2963,3067,3067,3181,3181,5153,6779,7451,
%U A341632 9463,9463,9859,10061,10061,10061,10061,10889,17539,17539,17539,17539,22229,22229,22229,30869,30869,30869,32717
%N A341632 Primes in A073837.
%C A341632 Terms can occur more than once, corresponding to repeated values in A341631.
%H A341632 Robert Israel, <a href="/A341632/b341632.txt">Table of n, a(n) for n = 1..10000</a>
%F A341632 a(n) = A073837(A341631(n)).
%e A341632 a(3) = A073837(A341631(3)) = A073837(9) = 41.
%p A341632 R:= 5: S:= [2, 3]: s:= 5: q:= 5: count:= 1:
%p A341632 for n from 3 while count < 100 do
%p A341632   if n = S[1]+1 then S:= S[2..-1]; s:= s-n+1 fi;
%p A341632 if q <= 2*n then S:= [op(S), q]; s:= s+q; q:= nextprime(q) fi;
%p A341632 if s mod n = 0 then count:= count+1; R:= R, s fi;
%p A341632 od:
%p A341632 R;
%Y A341632 Cf. A073837, A341631.
%K A341632 nonn
%O A341632 1,1
%A A341632 _J. M. Bergot_ and _Robert Israel_, Feb 16 2021