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.

A365277 Numbers of the form prime(i)*prime(j)*prime(i+j).

This page as a plain text file.
%I A365277 #6 Aug 30 2023 20:52:28
%S A365277 12,30,63,70,154,165,273,286,325,442,561,595,646,741,874,931,1045,
%T A365277 1173,1334,1495,1653,1771,1798,2139,2294,2465,2639,2945,3034,3219,
%U A365277 3509,3526,3689,3813,4042,4255,4433,4773,4921,4982,5781,5945,6253,6254,6601,6665,6837,6919,7198,8174,8319,8569,8695
%N A365277 Numbers of the form prime(i)*prime(j)*prime(i+j).
%C A365277 Members of A364462 that have no proper divisor in A364462.
%H A365277 Robert Israel, <a href="/A365277/b365277.txt">Table of n, a(n) for n = 1..10000</a>
%e A365277 a(3) = 63 is a term because 63 = 3^2 * 7 = prime(2) * prime(2) * prime(2+2).
%p A365277 N:= 10^4: # for terms <= N
%p A365277 S:= NULL:
%p A365277 for i from 1 do
%p A365277   p:= ithprime(i);
%p A365277   if 2*p^2 > N then break fi;
%p A365277   for j from 1 to i do
%p A365277     v:= p * ithprime(j)*ithprime(i+j);
%p A365277     if v > N then break fi;
%p A365277     S:= S,v
%p A365277   od
%p A365277 od:
%p A365277 sort([S]);
%Y A365277 Intersection of A014612 and A364462.
%K A365277 nonn
%O A365277 1,1
%A A365277 _Robert Israel_, Aug 30 2023