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.

A248551 Numbers n such that the smallest prime divisor of n^2+1 is 89.

This page as a plain text file.
%I A248551 #8 Aug 16 2019 16:04:49
%S A248551 144,390,856,1746,1814,1924,2170,2526,2636,2704,2814,3170,3416,3594,
%T A248551 3704,3950,4060,4306,4840,4950,5306,5484,6374,6620,6730,7086,7154,
%U A248551 7264,7866,7976,8044,8154,8400,8756,8866,9044,9400,9646,9824,10180,10290,11070,11426
%N A248551 Numbers n such that the smallest prime divisor of n^2+1 is 89.
%C A248551 Or numbers n such that the smallest prime divisor of n^2+1 is A002313(11).
%C A248551 a(n)== 34 or 144 (mod 178).
%H A248551 Amiram Eldar, <a href="/A248551/b248551.txt">Table of n, a(n) for n = 1..10000</a>
%e A248551 144 is in the sequence because 144^2+1= 89*233.
%t A248551 lst={};Do[If[FactorInteger[n^2+1][[1, 1]]==89, AppendTo[lst, n]], {n, 2, 10000}]; lst
%t A248551 p = 89; ps = Select[Range[p - 1], Mod[#, 4] != 3 && PrimeQ[#] &]; Select[Range[12000], Divisible[(nn = #^2 + 1), p] && ! Or @@ Divisible[nn, ps] &] (* _Amiram Eldar_, Aug 16 2019 *)
%Y A248551 Cf. A089120,A002313,A209874,A248527-A248531,A248549-A248553.
%K A248551 nonn,easy
%O A248551 1,1
%A A248551 _Michel Lagneau_, Oct 08 2014