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.

A136086 Son primes of order 9.

This page as a plain text file.
%I A136086 #11 Mar 17 2020 03:26:53
%S A136086 5,7,11,19,29,31,41,47,67,71,89,97,109,137,139,151,157,167,181,197,
%T A136086 211,241,251,271,277,307,311,337,367,379,397,409,421,509,557,571,587,
%U A136086 599,601,607,619,631,641,659,661,691,701,719,727,757,769,797,811,827,839
%N A136086 Son primes of order 9.
%C A136086 For smallest son primes of order n see A136027 (also definition). For son primes of order 1 see A023208. For son primes of order 2 see A023218. For son primes of order 3 see A023225. For son primes of order 4 see A023235. For son primes of order 5 see A136082. For son primes of order 6 see A136083. For son primes of order 7 see A136084. For son primes of order 8 see A136085.
%H A136086 Amiram Eldar, <a href="/A136086/b136086.txt">Table of n, a(n) for n = 1..10000</a>
%t A136086 n = 9; a = {}; Do[If[PrimeQ[(Prime[k] - 2n)/(2n + 1)], AppendTo[a, (Prime[k] - 2n)/(2n + 1)]], {k, 1, 1000}]; a
%t A136086 q=18;lst={};Do[p=Prime[n];If[PrimeQ[(q+1)*p+q],AppendTo[lst,p]],{n,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Mar 10 2009 *)
%Y A136086 Cf. A023208, A023218, A023225, A023235, A094524, A136019, A136020, A136026, A136027, A023208, A136082, A136083, A136084, A136085, A136087, A136088, A136089, A136090, A136091.
%K A136086 nonn
%O A136086 1,1
%A A136086 _Artur Jasinski_, Dec 12 2007