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.

A295169 a(n) = smallest number k with n prime factors such that (2d)^2 + (k/d)^2 is prime for every d | k.

This page as a plain text file.
%I A295169 #18 Nov 28 2017 12:38:05
%S A295169 1,3,65,5757
%N A295169 a(n) = smallest number k with n prime factors such that (2d)^2 + (k/d)^2 is prime for every d | k.
%C A295169 Such k must be an odd squarefree number.
%C A295169 Conjecture: the sequence is infinite.
%C A295169 a(4) > 10^10 if it exists. - _Charles R Greathouse IV_, Nov 28 2017
%Y A295169 Subsequence of A236423(n+1)/2 for n > 0.
%Y A295169 Cf. A295124.
%K A295169 nonn,more
%O A295169 0,2
%A A295169 _Thomas Ordowski_, Nov 16 2017
%E A295169 a(3) from _Paolo P. Lava_, Nov 16 2017