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.

A338537 Numbers that occur more than once in A338529.

This page as a plain text file.
%I A338537 #8 Nov 03 2020 16:10:47
%S A338537 4320,23142,301310,333414,340352,375650,553520,644490,910872,921730,
%T A338537 1133670,1366090,1422650,1440138,1650350,1705070,1751970,1874430,
%U A338537 2091850,2180768,2852640,3213780,3438548,3676320,4044732,4444662,4682000,4854274,4863754,5101914,5384106,6011250,6309860,6551688
%N A338537 Numbers that occur more than once in A338529.
%C A338537 Does any number occur more than twice in A338529?
%H A338537 Robert Israel, <a href="/A338537/b338537.txt">Table of n, a(n) for n = 1..609</a>
%e A338537 a(3) = 301310 is in the sequence because A338529(1618) = A338529(2414) = 301310.
%p A338537 A338529:= [seq(ithprime(n+2)*ithprime(n+3)-ithprime(n)*ithprime(n+1), n=1..100000)]):
%p A338537 M:= 12*ithprime(100000):
%p A338537 V:= Vector(M,datatype=integer[4]):
%p A338537 R:= NULL:
%p A338537 for i from 1 to 100000 do
%p A338537   v:= A338529[i];
%p A338537   if v <= M then V[v]:= V[v]+1; if V[v] > 1 then R:= R, v fi fi
%p A338537 od:
%p A338537 sort([R]);
%Y A338537 Cf. A338529.
%K A338537 nonn
%O A338537 1,1
%A A338537 _J. M. Bergot_ and _Robert Israel_, Nov 01 2020