A005384 -id:A005384 - cp's OEIS frontend

A068443 Triangular numbers which are the product of two primes.

6, 10, 15, 21, 55, 91, 253, 703, 1081, 1711, 1891, 2701, 3403, 5671, 12403, 13861, 15931, 18721, 25651, 34453, 38503, 49141, 60031, 64261, 73153, 79003, 88831, 104653, 108811, 114481, 126253, 146611, 158203, 171991, 188191, 218791, 226801, 258121, 269011

Offset: 1

Stephan Wagler (stephanwagler(AT)aol.com), Mar 09 2002

These triangular numbers are equal to p * (2p +- 1).
All terms belong to A006987. For n>2 all terms are odd and belong to A095147. - Alexander Adamchuk, Oct 31 2006
A156592 is a subsequence. - Reinhard Zumkeller, Feb 10 2009
Triangular numbers with exactly 4 divisors. - Jon E. Schoenfield, Sep 05 2018

			Triangular numbers begin 0, 1, 3, 6, 10, ...; 6=2*3, and 2 and 3 are two distinct primes; 10=2*5, and 2 and 5 are two distinct primes, etc. - _Vladimir Joseph Stephan Orlovsky_, Feb 27 2009
a(11) = 1891 and 1891 = 31 * 61.

Jon E. Schoenfield, Table of n, a(n) for n = 1..10000 (first 1000 terms from T. D. Noe)

Cf. A000217, A005382, A005384, A006987, A095147, A001358, A005385, A006881, A007304, A066179, A111206, A157342, A157344-A157347, A157352-A157357, A164977.

Cf. A075875.

q:= n-> is(numtheory[bigomega](n)=2):
select(q, [i*(i+1)/2$i=0..1000])[];  # Alois P. Heinz, Mar 27 2024

Select[ Table[ n(n + 1)/2, {n, 1000}], Apply[Plus, Transpose[ FactorInteger[ # ]] [[2]]] == 2 &]
Select[Accumulate[Range[1000]],PrimeOmega[#]==2&] (* Harvey P. Dale, Apr 03 2016 *)

list(lim)=my(v=List());forprime(p=2,(sqrtint(lim\1*8+1)+1)\4, if(isprime(2*p-1),listput(v,2*p^2-p)); if(isprime(2*p+1), listput(v,2*p^2+p))); Vec(v) \\ Charles R Greathouse IV, Jun 13 2013

A010054(a(n))*A064911(a(n)) = 1. - Reinhard Zumkeller, Dec 03 2009

a(n) = A000217(A164977(n)). - Zak Seidov, Feb 16 2015

Edited by Robert G. Wilson v, Jul 08 2002

Definition corrected by Zak Seidov, Mar 09 2008

A077065 Semiprimes of form prime - 1.

Original entry on oeis.org

4, 6, 10, 22, 46, 58, 82, 106, 166, 178, 226, 262, 346, 358, 382, 466, 478, 502, 562, 586, 718, 838, 862, 886, 982, 1018, 1186, 1282, 1306, 1318, 1366, 1438, 1486, 1522, 1618, 1822, 1906, 2026, 2038, 2062, 2098, 2206, 2446, 2458, 2578, 2818, 2878, 2902

Offset: 1

Reinhard Zumkeller, Oct 23 2002

nonn

There are 670 semiprimes of form prime-1 below 10^5.

			A001358(16) = 46 = 2*23 is a term as 46 = A000040(15) - 1 = 47 - 1.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Intersection of A006093 and A001358.
Intersection of A006093 and A100484.
Cf. A077068, A232342, A064911.
Cf. A005384, A005385.
Cf. A000010, A023900, A194593.

a077065 n = a077065_list !! (n-1)
a077065_list = filter ((== 1) . a010051' . (`div` 2)) a006093_list
-- Reinhard Zumkeller, Nov 22 2013, Oct 27 2012

IsSemiprime:=func; [s: n in [2..500] | IsSemiprime(s) where s is NthPrime(n)-1]; // Vincenzo Librandi, Oct 17 2012

q:= n-> (n::even) and andmap(isprime, [n+1, n/2]):
select(q, [$1..5000])[];  # Alois P. Heinz, Jul 19 2023

Select[Range[6000],Plus@@Last/@FactorInteger[#]==2&&PrimeQ[#+1]&] (* Vladimir Joseph Stephan Orlovsky, May 08 2011 *)
Select[Range[3000],PrimeOmega[#]==2&&PrimeQ[#+1]&] (* Harvey P. Dale, Oct 16 2012 *)
Select[ Prime@ Range@ 430 - 1, PrimeOmega@# == 2 &] (* Robert G. Wilson v, Feb 18 2014 *)

[x-1|x<-primes(10^4),bigomega(x-1)==2] \\ Charles R Greathouse IV, Nov 22 2013

a(n) = A005385(n) - 1 = 2*A005384(n).
A010051(A006093(a(n))/2) = A064911(A006093(a(n))) = 1. - Reinhard Zumkeller, Nov 22 2013
a(n) = A077068(n) - A232342(n). - Reinhard Zumkeller, Dec 16 2013
a(n) = A000010(A194593(n+1)). - Torlach Rush, Aug 23 2018
A000010((a(n)*2)+2) = A023900((a(n)*2)+2). - Torlach Rush, Aug 23 2018

A156660 Characteristic function of Sophie Germain primes.

Original entry on oeis.org

0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

Reinhard Zumkeller, Feb 13 2009

nonn

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
Wikipedia, Sophie Germain prime
Index entries for characteristic functions

Cf. A156659.

Cf. A005384, A156874, A092816.

a156660 n = fromEnum $ a010051 n == 1 && a010051 (2 * n + 1) == 1
-- Reinhard Zumkeller, May 01 2012

a(n)=isprime(n)&&isprime(2*n+1) \\ Felix Fröhlich, Aug 11 2014

a(n) = if n and also 2*n+1 is prime then 1 else 0.
a(A005384(n)) = 1; a(A138887(n)) = 0; a(A053176(n)) = 0.
A156874(n) = Sum_{k=1..n} a(k). - Reinhard Zumkeller, Feb 18 2009
a(n) = A010051(n)*A010051(2*n+1).
For n>1 a(n) = floor((floor(phi(n)/(n-1)) + floor(phi(2*n+1)/(2*n)))/2). - Enrique Pérez Herrero, Apr 28 2012
For n>1 a(n) = floor(phi(2*n^2+n)/(2*n^2-2*n)). - Enrique Pérez Herrero, May 02 2012

Definition corrected by Daniel Forgues, Aug 04 2009

A336467 Fully multiplicative with a(2) = 1 and a(p) = A000265(p+1) for odd primes p, with A000265(k) giving the odd part of k.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 1, 1, 1, 3, 3, 1, 7, 1, 3, 1, 9, 1, 5, 3, 1, 3, 3, 1, 9, 7, 1, 1, 15, 3, 1, 1, 3, 9, 3, 1, 19, 5, 7, 3, 21, 1, 11, 3, 3, 3, 3, 1, 1, 9, 9, 7, 27, 1, 9, 1, 5, 15, 15, 3, 31, 1, 1, 1, 21, 3, 17, 9, 3, 3, 9, 1, 37, 19, 9, 5, 3, 7, 5, 3, 1, 21, 21, 1, 27, 11, 15, 3, 45, 3, 7, 3, 1, 3, 15, 1, 49, 1, 3, 9, 51, 9, 13, 7, 3

Offset: 1

Antti Karttunen, Jul 22 2020

For the comment here, we extend the definition of the first kind of Cunningham chain (see Wikipedia-article) so that also isolated primes for which neither (p-1)/2 nor 2p+1 is a prime are considered to be in singular chains, that is, in chains of the length one. If we replace one or more instances of any particular odd prime factor p in n with any odd prime q of the same Cunningham chain, so that m = (q^k)*n / p^(e-k), where e is the exponent of p of n, and k <= e is the number of instances of p replaced with q, then it holds that a(m) = a(n), and by induction, the value stays invariant for any number of such replacements. Note also that A001222, but not necessarily A001221 will stay invariant in such changes.

For example, if some of the odd prime divisors p of n are Sophie Germain primes (in A005384), then replacing any of them with 2p+1 ("safe primes", i.e., the corresponding terms of A005385), gives a new number m, for which a(m) = a(n). And vice versa, the same is true for any safe prime factors > 5 of n (that are in A005385), then replacing any one of them with (p-1)/2 will not affect the result. For example, a(5*11*23*47) = a(11*11*23*23) = a(5^4) = a(11^4) = a(23^4) = 81, as 5, 11, 23 and 47 are in the same Cunningham chain of the first kind.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Wikipedia, Cunningham chain

Cf. A000265, A003959, A206787, A336390, A336392, A336651, A336921, A336922, A351461.

Cf. also A335915, A336466 (similar sequences).

A000265(n) = (n>>valuation(n,2));
A336467(n) = { my(f=factor(n)); prod(k=1,#f~,if(2==f[k,1],1,(A000265(f[k,1]+1))^f[k,2])); };

For all n >= 1, A331410(a(n)) = A336921(n).
From Antti Karttunen, Nov 21 2023: (Start)
a(n) = A335915(n) / A336466(n).
a(1) = 1, and for n > 1, a(n) = A000265(A206787(n)) * a(A336651(n)).
(End)

A023503 Greatest prime divisor of prime(n) - 1.

Original entry on oeis.org

2, 2, 3, 5, 3, 2, 3, 11, 7, 5, 3, 5, 7, 23, 13, 29, 5, 11, 7, 3, 13, 41, 11, 3, 5, 17, 53, 3, 7, 7, 13, 17, 23, 37, 5, 13, 3, 83, 43, 89, 5, 19, 3, 7, 11, 7, 37, 113, 19, 29, 17, 5, 5, 2, 131, 67, 5, 23, 7, 47, 73, 17, 31, 13, 79, 11, 7, 173, 29, 11, 179, 61, 31, 7, 191

Offset: 2

Clark Kimberling

nonn

Baker & Harman (1998) show that there are infinitely many n such that a(n) > prime(n)^0.677. This improves on earlier work of Goldfeld, Hooley, Fouvry, Deshouillers, Iwaniec, Motohashi, et al.
Fouvry shows that a(n) > prime(n)^0.6683 for a positive proportion of members of this sequence. See Fouvry and also Baker & Harman (1996) which corrected an error in the former work.
The record values are the Sophie Germain primes A005384. - Daniel Suteu, May 09 2017
Conjecture: every prime is in the sequence. Cf. A035095 (see my comment). - Thomas Ordowski, Aug 06 2017
a(n) is 2 for n in A159611, and is at most 3 for n in A174099. Conjecture: liminf a(n) = 3. - Jeppe Stig Nielsen, Jul 04 2020

T. D. Noe, Table of n, a(n) for n = 2..10000
R. C. Baker and G. Harman, The Brun-Titchmarsh theorem on average, Analytic Number Theory (Proceedings in honor of Heini Halberstam), Birkhäuser, Boston, 1996, pp. 39-103.
R. Baker and G. Harman, Shifted primes without large prime factors, Acta Arithmetica 83 (1998), pp. 331-361.
Étienne Fouvry, Théorème de Brun-Titchmarsh; application au théorème de Fermat, Invent. Math 79 (1985), 383-407.
D. M. Goldfeld, On the number of primes p for which p + a has a large prime factor, Mathematika 16 (1969), pp. 23-27.
R. R. Hall, Some properties of the sequence {p-1}, Acta Arith. 28 (1975/76), 101-105.
G. Harman, On the greatest prime factor of p-1 with effective constants

Cf. A006093, A006530.

Cf. A005384, A035095, A159611, A174099.

A023503 := proc(n)
    A006530(ithprime(n)-1) ;
end proc:
seq( A023503(n),n=2..80) ; # R. J. Mathar, Sep 07 2016

Table[FactorInteger[Prime[n] - 1][[-1, 1]], {n, 2, 100}] (* T. D. Noe, Jun 08 2011 *)

a(n) = vecmax(factor(prime(n)-1)[,1]); \\ Michel Marcus, Aug 15 2015

a(n) = A006530(A006093(n)). - Michel Marcus, Aug 15 2015

Comments, references, and links from Charles R Greathouse IV, Mar 04 2011

A045536 Primes p such that p+2 and 2p+1 are also prime.

Original entry on oeis.org

3, 5, 11, 29, 41, 179, 191, 239, 281, 419, 431, 641, 659, 809, 1019, 1031, 1049, 1229, 1289, 1451, 1481, 1931, 2129, 2141, 2339, 2549, 2969, 3299, 3329, 3359, 3389, 3539, 3821, 3851, 4019, 4271, 4481, 5231, 5279, 5441, 5501, 5639, 5741, 5849, 6131

Offset: 1

Thomas Kellar

Intersection of A001359 and A005384. - Zak Seidov, Feb 28 2017

T. D. Noe, Table of n, a(n) for n = 1..1000

Cf. A001359, A005384.

[p: p in PrimesUpTo(6200) | IsPrime(p+2) and IsPrime(2*p+1)]; // Vincenzo Librandi, Apr 08 2013

select(t -> isprime(t) and isprime(t+2) and isprime(2*t+1), [3, seq(t,t=5..10000,6)]); # Robert Israel, Feb 28 2017

Select[Prime[Range[1000]], PrimeQ[#+2] && PrimeQ[2#+1]&] (* Vladimir Joseph Stephan Orlovsky, Mar 30 2011*)

is(n)=isprime(n) && isprime(n+2) && isprime(2*n+1) \\ Charles R Greathouse IV, Feb 25 2014

Corrected by Jud McCranie, Dec 30 2000

Name changed and incorrect comment and program removed by T. D. Noe, Aug 05 2010

A059762 Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.

Original entry on oeis.org

41, 1031, 1451, 1481, 1511, 1811, 1889, 1901, 1931, 3449, 3491, 3821, 3911, 5081, 5441, 5849, 6101, 6131, 7151, 7349, 7901, 8969, 9221, 10691, 10709, 11171, 11471, 11801, 12101, 12821, 12959, 13229, 14009, 14249, 14321, 14669, 14741, 15161

Offset: 1

Labos Elemer, Feb 20 2001

nonn

Primes p such that {(p-1)/2, p, 2p+1, 4p+3, 8p+7} = {composite, prime, prime, prime, composite}.

			41 is a term because 20 and 325 are composites, and 41, 83, and 167 are primes.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Chris Caldwell's Prime Glossary, Cunningham chains.
Warut Roonguthai, Yves Gallot's Proth.exe and Cunningham Chains.
Eric Weisstein's World of Mathematics, Cunningham Chain.

Cf. A023272, A023302, A023330, A005384, A005385, A059452, A059453, A059454, A059455, A007700.

ipccQ[n_]:=Module[{c=(n-1)/2},PrimeQ[NestList[2#+1&,c,4]]=={False, True, True, True, False}]; Select[Prime[Range[2000]],ipccQ] (* Harvey P. Dale, Nov 10 2014 *)

Definition corrected by Alexandre Wajnberg, Aug 31 2005

Offset corrected by Amiram Eldar, Jul 15 2024

A063440 Number of divisors of n-th triangular number.

Original entry on oeis.org

1, 2, 4, 4, 4, 4, 6, 9, 6, 4, 8, 8, 4, 8, 16, 8, 6, 6, 8, 16, 8, 4, 12, 18, 6, 8, 16, 8, 8, 8, 10, 20, 8, 8, 24, 12, 4, 8, 24, 12, 8, 8, 8, 24, 12, 4, 16, 24, 9, 12, 16, 8, 8, 16, 24, 24, 8, 4, 16, 16, 4, 12, 36, 24, 16, 8, 8, 16, 16, 8, 18, 18, 4, 12, 24, 16, 16, 8, 16, 40, 10, 4, 16

Offset: 1

Henry Bottomley, Jul 24 2001

a(n) = 4 iff either n is in A005383 or n/2 is in A005384.
a(n) is odd iff n is in A001108.
a(n) = 6 if either n = 18 or n = q^2 where q is in A048161 or n = 2 q^2 - 1 where q is in A106483. - Robert Israel, Oct 26 2015
From Bernard Schott, Aug 29 2020: (Start)
a(n-1) is the number of solutions in positive integers (x, y, z) to the simultaneous equations (x + y - z = n, x^2 + y^2 - z^2 = n) for n > 1. See the British Mathematical Olympiad link. In this case, one always has z > x and z > y.
For n = 12 as in the Olympiad problem, the a(11) = 8 solutions are (13,78,79), (14,45,47), (15,34,37), (18,23,29), (23,18,29), (34,15,37), (45,14,47), (78,13,79). (End)

			a(6) = 4 since 1+2+3+4+5+6 = 21 has four divisors {1,3,7,21}.

Steve Dinh, The Hard Mathematical Olympiad Problems And Their Solutions, AuthorHouse, 2011, Problem 2 of the British Mathematical Olympiad 2007, page 28.

Ray Chandler, Table of n, a(n) for n = 1..10000
British Mathematical Olympiad 2007/2008, Round 1, Problem 2.
Index to sequences related to Olympiads.

Cf. A000005, A000217.

Cf. A001108, A005383, A005384, A048161, A060778, A081978 (greedy inverse), A106483, A101755 (indices of records), A101756 (records).

seq(numtheory:-tau(n*(n+1)/2), n=1..100); # Robert Israel, Oct 26 2015

DivisorSigma[0,#]&/@Accumulate[Range[90]] (* Harvey P. Dale, Apr 15 2019 *)

for (n=1, 10000, write("b063440.txt", n, " ", numdiv(n*(n + 1)/2)) ) \\ Harry J. Smith, Aug 21 2009

a(n)=factorback(apply(numdiv,if(n%2,[n,(n+1)/2],[n/2,n+1]))) \\ Charles R Greathouse IV, Dec 27 2014

vector(100, n, numdiv(n*(n+1)/2)) \\ Altug Alkan, Oct 26 2015

a(n) = A000005(A000217(n)).
From Robert Israel, Oct 26 2015: (Start)
a(2k) = A000005(k)*A000005(2k+1).
a(2k+1) = A000005(2k+1)*A000005(k+1).
gcd(a(2k), a(2k+1)) = A000005(2k+1) * A060778(k). (End)

A051254 Mills primes.

Original entry on oeis.org

2, 11, 1361, 2521008887, 16022236204009818131831320183, 4113101149215104800030529537915953170486139623539759933135949994882770404074832568499

Offset: 1

Simon Plouffe

Mills showed that there is a number A > 1 but not an integer, such that floor( A^(3^n) ) is a prime for all n = 1, 2, 3, ... A is approximately 1.306377883863... (see A051021).
a(1) = 2 and (for n > 1) a(n) is least prime > a(n-1)^3. - Jonathan Vos Post, May 05 2006, corrected by M. F. Hasler, Sep 11 2024
The name refers to the American mathematician William Harold Mills (1921-2007). - Amiram Eldar, Jun 23 2021

			a(3) = 1361 = 11^3 + 30 = a(2)^3 + 30 and there is no smaller k such that a(2)^3 + k is prime. - _Jonathan Vos Post_, May 05 2006

Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 8.
Steven R. Finch, Mathematical Constants, Encyclopedia of Mathematics and its Applications, vol. 94, Cambridge University Press, 2003, Section 2.13, p. 130.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 137.

Robert G. Wilson v, Table of n, a(n) for n = 1..8
Chris K. Caldwell, Mills' Theorem - a generalization.
Chris K. Caldwell and Yuanyou Chen, Determining Mills' Constant and a Note on Honaker's Problem, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.1.
Steven R. Finch, Mills' Constant. [Broken link]
Steven R. Finch, Mills' Constant. [From the Wayback machine]
Dylan Fridman, Juli Garbulsky, Bruno Glecer, James Grime and Massi Tron Florentin, A Prime-Representing Constant, Amer. Math. Monthly, Vol. 126, No. 1 (2019), pp. 72-73; ResearchGate link, arXiv preprint, arXiv:2010.15882 [math.NT], 2020.
James Grime and Brady Haran, Awesome Prime Number Constant, Numberphile video, 2013.
Brian Hayes, Pumping the Primes, bit-player, Aug 19 2015.
Ernest G. Hibbs, Component Interactions of the Prime Numbers, Ph. D. Thesis, Capitol Technology Univ. (2022), see p. 33.
William H. Mills, A prime-representing function, Bull. Amer. Math. Soc., Vol. 53, No. 6 (1947), p. 604; Errata, ibid., Vol. 53, No 12 (1947), p. 1196.
Simon Plouffe, The calculation of p(n) and pi(n), arXiv:2002.12137 [math.NT], 2020.
László Tóth, A Variation on Mills-Like Prime-Representing Functions, arXiv:1801.08014 [math.NT], 2018.
Juan L. Varona, A Couple of Transcendental Prime-Representing Constants, arXiv:2012.11750 [math.NT], 2020.
Eric Weisstein's World of Mathematics, Mills' Prime.
Eric Weisstein's World of Mathematics, Prime Formulas.
Eric W. Weisstein, Table of n, a(n) for n = 1..13.

Cf. A001358, A055496, A076656, A006992, A005384, A005385, A118908, A118909, A118910, A118911, A118912, A118913.
Cf. A224845 (integer lengths of Mills primes).
Cf. A108739 (sequence of offsets b_n associated with Mills primes).
Cf. A051021 (decimal expansion of Mills constant).

floor(A^(3^n), n=1..10); # A is Mills's constant: 1.306377883863080690468614492602605712916784585156713644368053759966434.. (A051021).

p = 1; Table[p = NextPrime[p^3], {6}] (* T. D. Noe, Sep 24 2008 *)
NestList[NextPrime[#^3] &, 2, 5] (* Harvey P. Dale, Feb 28 2012 *)

a(n)=if(n==1, 2, nextprime(a(n-1)^3)) \\ Charles R Greathouse IV, Jun 23 2017

apply( {A051254(n, p=2)=while(n--, p=nextprime(p^3));p}, [1..6]) \\ M. F. Hasler, Sep 11 2024

a(1) = 2; a(n) is least prime > a(n-1)^3. - Jonathan Vos Post, May 05 2006

Edited by N. J. A. Sloane, May 05 2007

A059456 Unsafe primes: primes not in A005385.

Original entry on oeis.org

2, 3, 13, 17, 19, 29, 31, 37, 41, 43, 53, 61, 67, 71, 73, 79, 89, 97, 101, 103, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 173, 181, 191, 193, 197, 199, 211, 223, 229, 233, 239, 241, 251, 257, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337

Offset: 1

Labos Elemer, Feb 02 2001

nonn

A010051(a(n))*(1-A156659(a(n))) = 1; subsequence of A156657. - Reinhard Zumkeller, Feb 18 2009
Also, primes p such that p-1 is a non-semiprime. - Juri-Stepan Gerasimov, Apr 28 2010
Conjecture: From the sequence of prime numbers, let 2 and remove the first data iteration of 2*p+1; leave 3 and remove the prime data by the iteration 2*p+1 and we get the sequence. Example for p=2, remove(5,11,23,47); p=3, remove(7); p=13, p=17, p=19, p=23, remove(47); and so on. - Vincenzo Librandi, Aug 07 2010

			31 is here because (31-1)/2=15 is not prime. 2 and 3 are here because 1/2 and 1 are not prime numbers.

Michael De Vlieger, Table of n, a(n) for n = 1..10000

Cf. A005384, A005385, A053176, A059452-A059456, A007700, A005602, A023272, A023302, A023330.

Initial terms for groups in A075712.

Complement[Prime@ Range@ PrimePi@ Max@ #, #] &@ Select[Prime@ Range@ 90, PrimeQ[(# - 1)/2] &] (* Michael De Vlieger, May 01 2016 *)
Select[Prime[Range[100]],PrimeOmega[#-1]!=2&] (* Harvey P. Dale, May 13 2018 *)

is(n)=isprime(n) && !isprime(n\2) \\ Charles R Greathouse IV, May 02 2016

a(n) ~ n log n. - Charles R Greathouse IV, Dec 29 2024

cp's OEIS Frontend

A068443 Triangular numbers which are the product of two primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A077065 Semiprimes of form prime - 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

A156660 Characteristic function of Sophie Germain primes.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

PARI

Formula

Extensions

A336467 Fully multiplicative with a(2) = 1 and a(p) = A000265(p+1) for odd primes p, with A000265(k) giving the odd part of k.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A023503 Greatest prime divisor of prime(n) - 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A045536 Primes p such that p+2 and 2p+1 are also prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Extensions

A059762 Initial primes of Cunningham chains of first type with length exactly 3. Primes in A059453 that survive as primes just two "2p+1 iterations", forming chains of exactly 3 terms.

Views

Author