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.

A226495 The number of primes of the form i^2+j^4 (A028916) <= 10^n, counted with multiplicity.

This page as a plain text file.
%I A226495 #13 Nov 03 2024 02:10:10
%S A226495 2,8,34,134,615,2813,13415,65162,323858,1626844,8268241,42417710
%N A226495 The number of primes of the form i^2+j^4 (A028916) <= 10^n, counted with multiplicity.
%C A226495 Iwaniec and Friedlander have proved there is infinity of the primes of the form i^2+j^4.
%C A226495 Primes with more than one representation are counted multiple times.
%C A226495 If we do not count repetitions, the sequence is A226497: 2, 6, 28, 121, 583, 2724, 13175, 64551, ..., .
%e A226495 2 = 1^2+1^4, 5 = 2^2+1^4, 17 = 4^2+1^4 = 1^2+2^4, …, 97 = 9^2+2^4 = 4^2+3^4, etc.
%t A226495 mx = 10^12; lst = {};  Do[a = i^2 + j^4; If[ PrimeQ[a], AppendTo[ lst, a]], {i, Sqrt[mx]}, {j, Sqrt[ Sqrt[mx - i^2]]}]; Table[ Length@ Select[lst, # < 10^n &], {n, 12}]
%Y A226495 Cf. A028916, A226496, A226497, A226498.
%K A226495 nonn,more
%O A226495 1,1
%A A226495 _Marek Wolf_ and _Robert G. Wilson v_, Jun 09 2013