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.

A227199 Primes that divide some term of A006720.

This page as a plain text file.
%I A227199 #21 Sep 08 2022 08:46:05
%S A227199 2,3,7,11,23,41,47,53,59,61,71,73,83,97,101,113,127,139,149,157,173,
%T A227199 179,181,191,197,199,211,223,229,239,257,263,271,277,281,307,331,337,
%U A227199 347,359,373,379,383,389,397,409,419,433,439,443,463,467,479,499,509
%N A227199 Primes that divide some term of A006720.
%C A227199 The density of primes in this sequence is 11/21.
%C A227199 If p divides A006720(n) for some n, then the smallest such n is <= (1/2)*((sqrt(p)+1)^2+3).
%H A227199 Jeremy Rouse, <a href="/A227199/b227199.txt">Table of n, a(n) for n = 1..10000</a>
%H A227199 R. Jones and J. Rouse, <a href="http://arxiv.org/abs/0706.2384">Galois Theory of Iterated Endomorphisms</a>, Proceedings of the London Mathematical Society, 100, no. 3 (2010), 763-794.
%e A227199 11 is in the sequence because 11 divides A006720(10) = 1529.
%o A227199 (Magma) [ n : n in [2..500] | IsPrime(n) and (n ne 37) and (Order(EllipticCurve([GF(n)!0,0,1,-1,0])![0,0,1]) mod 2 eq 1) ];
%K A227199 easy,nonn
%O A227199 1,1
%A A227199 _Jeremy Rouse_, Sep 18 2013