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.

A298865 The primes p and products 4*p in increasing order.

This page as a plain text file.
%I A298865 #4 Feb 14 2018 08:24:00
%S A298865 2,3,5,7,8,11,12,13,17,19,20,23,28,29,31,37,41,43,44,47,52,53,59,61,
%T A298865 67,68,71,73,76,79,83,89,92,97,101,103,107,109,113,116,124,127,131,
%U A298865 137,139,148,149,151,157,163,164,167,172,173,179,181,188,191,193
%N A298865 The primes p and products 4*p in increasing order.
%C A298865 Conjecture: except for the first term, these are the nonsquares n for which there is a unique pair (x,y) such that x^2 - y^2 = n and x > y >= 0; see A257408.
%H A298865 Clark Kimberling, <a href="/A298865/b298865.txt">Table of n, a(n) for n = 1..1000</a>
%t A298865 z = 10000; u = Prime[Range[z]]; w = Take[Union[u, 4 u], z]; (* A298865 *)
%t A298865 p[n_] := If[MemberQ[u, w[[n]]], 0, 1];
%t A298865 t = Table[p[n], {n, 1, z}];
%t A298865 Flatten[Position[t, 0]];  (* A298866 *)
%t A298865 Flatten[Position[t, 1]];  (* A298867 *)
%Y A298865 Cf. A000040, A298866, A298867.
%K A298865 nonn,easy
%O A298865 1,1
%A A298865 _Clark Kimberling_, Feb 13 2018