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.

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

This page as a plain text file.
%I A226496 #17 Nov 03 2024 02:13:16
%S A226496 1,1,2,2,4,6,9,13,21,34,50,77,121,191,292,458,727,1164,1840,2904,4650,
%T A226496 7429,11869,19087,30760,49474,79971,129226,209823,340347,552722,
%U A226496 898655,1461698,2381041,3883079,6338935,10357549,16935173,27712338,45381521,51559329
%N A226496 The number of primes of the form i^2 + j^4 (A028916) <= 2^n, counted with multiplicity.
%C A226496 Iwaniec and Friedlander have proved there is infinity of the primes of the form i^2 + j^4.
%C A226496 Counted with double representations. If we do not count doubles, the sequence is A226498.
%e A226496 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 A226496 mx = 2^40; 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, # <2^n &], {n, 40}]
%Y A226496 Cf. A028916, A226495, A226497, A226498.
%K A226496 nonn
%O A226496 1,3
%A A226496 _Marek Wolf_ and _Robert G. Wilson v_, Jun 09 2013