A006093 -id:A006093 - cp's OEIS frontend

A084921 a(n) = lcm(p-1, p+1) where p is the n-th prime.

3, 4, 12, 24, 60, 84, 144, 180, 264, 420, 480, 684, 840, 924, 1104, 1404, 1740, 1860, 2244, 2520, 2664, 3120, 3444, 3960, 4704, 5100, 5304, 5724, 5940, 6384, 8064, 8580, 9384, 9660, 11100, 11400, 12324, 13284, 13944, 14964, 16020, 16380

Offset: 1

Reinhard Zumkeller, Jun 11 2003

nonn

This sequence consists of terms of sequences A055523 and A055527 for prime n > 2. - Toni Lassila (tlassila(AT)cc.hut.fi), Feb 02 2004

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Christian Krause, LODA program for A084921
Index entries for sequences related to lcm's

Cf. A000040, A006093, A008864, A009286, A024700, A055523, A055527, A084920, A084922.

a084921 n = lcm (p - 1) (p + 1)  where p = a000040 n
-- Reinhard Zumkeller, Jun 01 2013

[3] cat [(p^2-1)/2: p in PrimesInInterval(3,300)]; // G. C. Greubel, May 03 2024

LCM[#-1,#+1]&/@Prime[Range[50]] (* Harvey P. Dale, Oct 09 2018 *)

a(n)=if(n<2,3,(prime(n)^2-1)/2) \\ Charles R Greathouse IV, May 15 2013

[3]+[(n^2-1)/2 for n in prime_range(3,301)] # G. C. Greubel, May 03 2024

a(n) = A084920(n)/2 for n > 1.
a(n) = 3*A084922(n) for n > 2.
a(n) = A009286(A000040(n)). - Enrique Pérez Herrero, May 17 2012
a(n) ~ 0.5 n^2 log^2 n. - Charles R Greathouse IV, May 15 2013
Product_{n>=1} (1 + 1/a(n)) = 2. - Amiram Eldar, Jan 23 2021
a(n) = (A000040(n)^2 - 1) / 2 for n > 1. - Christian Krause, Mar 27 2021
a(n) = (3/2)*A024700(n-2), for n > 1. - G. C. Greubel, May 03 2024

A057778 a(n) is the least odd k such that k*2^n + 1 is prime.

Original entry on oeis.org

1, 1, 1, 5, 1, 3, 3, 5, 1, 15, 13, 9, 3, 5, 7, 5, 1, 9, 3, 11, 7, 11, 25, 45, 45, 5, 7, 15, 13, 23, 3, 35, 43, 9, 75, 59, 3, 15, 15, 5, 27, 3, 9, 9, 15, 35, 19, 27, 15, 23, 7, 17, 7, 51, 49, 5, 27, 29, 99, 27, 31, 53, 105, 9, 25, 9, 3, 9, 31, 23, 39, 39, 127, 23, 67, 5, 93, 29, 15, 249

Offset: 0

Labos Elemer, Nov 02 2000

nonn

There are no Sierpiński numbers in the sequence. See A076336. - Thomas Ordowski, Aug 13 2017

Conjecture: for n > 0, a(n) = k < 2^n, so k*2^n + 1 is a Proth prime A080076. - Thomas Ordowski, Apr 13 2019

			For n = 10, the first primes in the 1024k + 1 arithmetic progression occur at k = 12, 13, 15, 18, 19, ...; 13 is the first odd number, so a(10)=13, while A035050(10)=12. The corresponding primes are 12289 and 13313.
For n = 79, the first primes in the (2^79)k + 1 = 604462909807314587353088k + 1 progression occur at k = 36, 44, 104, 249, 296, 299, so a(79)=249, the first odd number, while A035050(79)=36. The two primes arising are 21760664753063325144711169 and 150511264542021332250918913, respectively.

T. D. Noe, Table of n, a(n) for n = 0..1000
Poo-Sung Park, Multiplicative functions with f(p + q - n_0) = f(p) + f(q) - f(n_0), arXiv:2002.09908 [math.NT], 2020.
Index entries for sequences related to primes in arithmetic progressions

Terms are not necessarily in A035050.

Cf. A006093, A035050, A076336, A080076 A085427, A126717.

Table[k = 1; While[! PrimeQ[k 2^n + 1], k += 2]; k, {n, 0, 80}] (* Michael De Vlieger, Jul 04 2016 *)

a(n) = k=1; while(!isprime(k*2^n+1), k+=2); k; \\ Michel Marcus, Dec 10 2013

a(n) = Min{k: 1+2^n*k is prime and k is odd}.
a(n) << 19^n by Xylouris's improvement to Linnik's theorem. - Charles R Greathouse IV, Dec 10 2013
Conjecture: a(n) = O(n*log(n)). - Thomas Ordowski, Oct 16 2014

A072668 Numbers one less than composite numbers.

Original entry on oeis.org

3, 5, 7, 8, 9, 11, 13, 14, 15, 17, 19, 20, 21, 23, 24, 25, 26, 27, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 59, 61, 62, 63, 64, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 80, 81, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95

Offset: 1

Henry Bottomley, Apr 11 2001

Complement of A006093 (primes minus 1).
Numbers which can be written as i*j+i+j, 0A072670(a(n))>0 for n>1.
a(n)! is divisible by a(n)*(a(n)+1)/2, see A060462.

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

Cf. A060462, A066938, A072672.

Cf. A002808, A006093, A079696.

[n-1: n in [2..120] | not IsPrime(n)]; // Vincenzo Librandi, Jun 09 2015

Select[Range[4, 96], CompositeQ] - 1 (* Michael De Vlieger, Dec 10 2020 *)

for(n=2,100,if(!isprime(n),print1(n-1,", "))) \\ Derek Orr, Jun 08 2015

from sympy import composite
def A072668(n): return composite(n)-1 # Chai Wah Wu, Aug 02 2024

a(n) = A002808(n) - 1.
a(n) = 2*A002808(n) - A079696(n). - Juri-Stepan Gerasimov, Oct 22 2009
a(n) = A060462(n).

A084740 Least k such that (n^k-1)/(n-1) is prime, or 0 if no such prime exists.

Original entry on oeis.org

2, 3, 2, 3, 2, 5, 3, 0, 2, 17, 2, 5, 3, 3, 2, 3, 2, 19, 3, 3, 2, 5, 3, 0, 7, 3, 2, 5, 2, 7, 0, 3, 13, 313, 2, 13, 3, 349, 2, 3, 2, 5, 5, 19, 2, 127, 19, 0, 3, 4229, 2, 11, 3, 17, 7, 3, 2, 3, 2, 7, 3, 5, 0, 19, 2, 19, 5, 3, 2, 3, 2, 5, 5, 3, 41, 3, 2, 5, 3, 0, 2, 5, 17, 5, 11, 7, 2, 3, 3, 4421, 439, 7, 5, 7, 2, 17, 13, 3, 2, 3, 2, 19, 97, 3, 2, 17, 2, 17, 3, 3, 2, 23, 29, 7, 59

Offset: 2

Amarnath Murthy and Meenakshi Srikanth (menakan_s(AT)yahoo.com), Jun 15 2003

nonn

When (n^k-1)/(n-1) is prime, k must be prime. As mentioned by Dubner, when n is a perfect power, then (n^k-1)/(n-1) will usually be composite for all k, which is the case for n = 9, 25, 32, 49, 64, 81, 121, 125, 144, 169, 216, 225, 243, 289, 324, 343, ... - T. D. Noe, Jan 30 2004
a(152) > prime(1100) or 0. - Derek Orr, Nov 29 2014
a(n)=2 if and only if n=p-1, where p is an odd prime; that is, n belongs to A006093, except 2. - Thomas Ordowski, Sep 19 2015
Probably a(152) = 270217 since (152^270217-1)/(152-1) has been shown to be probably prime. - Michael Stocker, Jan 24 2019

			a(7) = 5 as (7^5 - 1 )/(7 - 1) = 2801 = 1 + 7 + 7^2 + 7^3 + 7^4 is a prime but no smaller partial sum yields a prime.

Eric Chen, Table of known a(n) up to a(360) [with a(316) corrected by Jon E. Schoenfield]
H. Dubner, Generalized repunit primes, Math. Comp., 61 (1993), 927-930.
Andy Steward, Titanic Prime Generalized Repunits
Eric Weisstein's World of Mathematics, Repunit
Robert G. Wilson v, Letter to N. J. A. Sloane, circa 1991.
Robert G. Wilson v, Table of known a(n) from n = 2 to 1000.

Cf. A065507, A065854, A084738, A084742, A096059, A126659, A128164, A246005.

Cf. A066180, A085398, A103795, A123487, A123627.

a(n) = {l=List([9, 25, 32, 49, 64, 81, 121, 125, 144, 169, 216, 225, 243, 289, 324, 343]); for(q=1, #l, if(n==l[q], return(0))); k=1; while(k, s=(n^prime(k)-1)/(n-1); if(ispseudoprime(s), return(prime(k))); k++)}
n=2; while(n<361, print1(a(n), ", "); n++) \\ Derek Orr, Jul 13 2014

More terms from T. D. Noe, Jan 23 2004

A143201 Product of distances between prime factors in factorization of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 6, 3, 1, 1, 2, 1, 4, 5, 10, 1, 2, 1, 12, 1, 6, 1, 6, 1, 1, 9, 16, 3, 2, 1, 18, 11, 4, 1, 10, 1, 10, 3, 22, 1, 2, 1, 4, 15, 12, 1, 2, 7, 6, 17, 28, 1, 6, 1, 30, 5, 1, 9, 18, 1, 16, 21, 12, 1, 2, 1, 36, 3, 18, 5, 22, 1, 4, 1, 40, 1, 10, 13, 42, 27, 10, 1, 6, 7, 22

Offset: 1

Reinhard Zumkeller, Aug 12 2008

nonn

a(n) is the product of the sum of 1 and first differences of prime factors of n with multiplicity, with a(n) = 1 for n = 1 or prime n. - Michael De Vlieger, Nov 12 2023.
a(A007947(n)) = a(n);
A006093 and A001747 give record values and where they occur:
A006093(n)=a(A001747(n+1)) for n>1.
a(n) = 1 iff n is a prime power: a(A000961(n))=1;
a(n) = 2 iff n has exactly 2 and 3 as prime factors:
a(A033845(n))=2;
a(n) = 3 iff n is in A143202;
a(n) = 4 iff n has exactly 2 and 5 as prime factors:
a(A033846(n))=4;
a(n) = 5 iff n is in A143203;
a(n) = 6 iff n is in A143204;
a(n) = 7 iff n is in A143205;
a(n) <> A006512(k)+1 for k>1.
a(A033849(n))=3; a(A033851(n))=3; a(A033850(n))=5; a(A033847(n))=6; a(A033848(n))=10. [Reinhard Zumkeller, Sep 19 2011]

			a(86) = a(43*2) = 43-2+1 = 42;
a(138) = a(23*3*2) = (23-3+1)*(3-2+1) = 42;
a(172) = a(43*2*2) = (43-2+1)*(2-2+1) = 42;
a(182) = a(13*7*2) = (13-7+1)*(7-2+1) = 42;
a(276) = a(23*3*2*2) = (23-3+1)*(3-2+1)*(2-2+1) = 42;
a(330) = a(11*5*3*2) = (11-5+1)*(5-3+1)*(3-2+1) = 42.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for primes, gaps between

Cf. A000961, A001747, A006093, A020639, A033845, A033846.
Cf. A033847, A033848, A033849, A033850.
Cf. A143203, A143204, A143205.
Cf. A027746.

a143201 1 = 1
a143201 n = product $ map (+ 1) $ zipWith (-) (tail pfs) pfs
   where pfs = a027748_row n
-- Reinhard Zumkeller, Sep 13 2011

Table[Times@@(Differences[Flatten[Table[First[#],{Last[#]}]&/@ FactorInteger[ n]]]+1),{n,100}] (* Harvey P. Dale, Dec 07 2011 *)

a(n) = f(n,1,1) where f(n,q,y) = if n=1 then y else if q=1 then f(n/p,p,1)) else f(n/p,p,y*(p-q+1)) with p = A020639(n) = smallest prime factor of n.

A375704 Maximum of the n-th maximal run of adjacent (increasing by one at a time) non-perfect-powers.

Original entry on oeis.org

3, 7, 15, 24, 26, 31, 35, 48, 63, 80, 99, 120, 124, 127, 143, 168, 195, 215, 224, 242, 255, 288, 323, 342, 360, 399, 440, 483, 511, 528, 575, 624, 675, 728, 783, 840, 899, 960, 999, 1023, 1088, 1155, 1224, 1295, 1330, 1368, 1443, 1520, 1599, 1680, 1727, 1763

Offset: 1

Gus Wiseman, Aug 29 2024

nonn

Non-perfect-powers (A007916) are numbers with no proper integer roots.

Also numbers k > 0 such that k is a perfect power (A001597) but k+1 is not.

			The list of all non-perfect-powers, split into runs, begins:
   2   3
   5   6   7
  10  11  12  13  14  15
  17  18  19  20  21  22  23  24
  26
  28  29  30  31
  33  34  35
  37  38  39  40  41  42  43  44  45  46  47  48
Row n begins with A375703(n), ends with a(n), adds up to A375705(n), and has length A375702(n).

For nonprime numbers: A006093, min A055670, anti-runs A068780, min A005381.
For prime numbers we have A045344.
Inserting 8 after 7 gives A045542.
For nonsquarefree numbers we have A072284(n) + 1, anti-runs A068781.
For squarefree numbers we have A373415, anti-runs A007674.
For prime-powers we have A373674 (min A373673), anti-runs A006549 (A120430).
Non-prime-powers: A373677 (min A373676), anti-runs A255346 (min A373575).
The anti-run version is A375739.
A001597 lists perfect-powers, differences A053289.
A046933 counts composite numbers between primes.
A375736 gives lengths of anti-runs of non-prime-powers, sums A375737.
For runs of non-perfect-powers (A007916):
- length: A375702 = A053289(n+1) - 1
- first: A375703 (same as A216765 with 2 exceptions)
- last: A375704 (this) (same as A045542 with 8 removed)
- sum: A375705
Cf. A053797, A053806, A061398, A061399, A251092, A373408, A375708, A375714.

radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
Max/@Split[Select[Range[100],radQ],#1+1==#2&]//Most
- or -
radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
Select[Range[100],radQ[#]&&!radQ[#+1]&]

For n > 2 we have a(n) = A045542(n+1).

A377288 Numbers k such that there are exactly two prime-powers between prime(k)+1 and prime(k+1)-1.

Original entry on oeis.org

4, 9, 30, 327, 3512

Offset: 1

Gus Wiseman, Oct 25 2024

Is this sequence finite? For this conjecture see A053706, A080101, A366833.

Any further terms are > 10^12. - Lucas A. Brown, Nov 08 2024

			Primes 9 and 10 are 23 and 29, and the interval (24, 25, 26, 27, 28) contains the prime-powers 25 and 27, so 9 is in the sequence.

Lucas A. Brown, Python program.

The interval from A008864(n) to A006093(n+1) has A046933 elements.
For powers of 2 instead of primes see A013597, A014210, A014234, A244508, A304521.
The corresponding primes are A053706.
The nearest prime-power before prime(n)-1 is A065514, difference A377289.
The nearest prime-power after prime(n)+1 is A345531, difference A377281.
These are the positions of 2 in A080101, or 3 in A366833.
For at least one prime-power we have A377057, primes A053607.
For no prime-powers we have A377286.
For exactly one prime-power we have A377287.
For squarefree instead of prime-power see A377430, A061398, A377431, A068360.
A000015 gives the least prime-power >= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A031218 gives the greatest prime-power <= n.
A246655 lists the prime-powers not including 1, complement A361102.
Cf. A001597, A002808, A024619, A053707, A064113, A065890, A075526, A095195, A224363, A276781, A376596, A376597, A377282.

Select[Range[100], Length[Select[Range[Prime[#]+1,Prime[#+1]-1],PrimePowerQ]]==2&]

prime(a(n)) = A053706(n).

A028815 a(n) = prime(n) + 1 (starting with 1).

Original entry on oeis.org

2, 3, 4, 6, 8, 12, 14, 18, 20, 24, 30, 32, 38, 42, 44, 48, 54, 60, 62, 68, 72, 74, 80, 84, 90, 98, 102, 104, 108, 110, 114, 128, 132, 138, 140, 150, 152, 158, 164, 168, 174, 180, 182, 192, 194, 198, 200, 212, 224, 228, 230, 234, 240, 242, 252, 258, 264, 270, 272, 278, 282, 284

Offset: 0

N. J. A. Sloane

n-th noncomposite (unit or prime) positive integer + 1.

The "0th prime" is defined to be 1 (a unit, formerly considered to be prime).

G. C. Greubel, Table of n, a(n) for n = 0..10000

Cf. A000040, A006093, A008578, A008864.

Cf. A141130, A141132, A141133, A141136, A141138.

A028815:= func< n | n eq 0 select 2 else 1 + NthPrime(n) >;
[A028815(n): n in [0..70]]; // G. C. Greubel, Aug 05 2024

Join[{2},Prime[Range[70]]+1] (* Harvey P. Dale, Oct 14 2019 *)

a(n) = if(n==0, 2, prime(n) + 1); \\ Altug Alkan, Mar 14 2018

def A028815(n): return 2 if n==0 else 1+nth_prime(n)
[A028815(n) for n in range(71)] # G. C. Greubel, Aug 05 2024

a(n) = prime(n) + 1 = A000040(n) + 1 = A008864(n) for n >= 1.
a(n) = A008578(n+1) + 1, n >= 0.
a(n) = 2*A006254(n-1), for n >= 2, with a(0) = 2, a(1) = 3. - G. C. Greubel, Aug 05 2024

A181062 Prime powers minus 1.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 7, 8, 10, 12, 15, 16, 18, 22, 24, 26, 28, 30, 31, 36, 40, 42, 46, 48, 52, 58, 60, 63, 66, 70, 72, 78, 80, 82, 88, 96, 100, 102, 106, 108, 112, 120, 124, 126, 127, 130, 136, 138, 148, 150, 156, 162, 166, 168, 172, 178, 180, 190, 192, 196, 198, 210, 222, 226

Offset: 1

Matthew Vandermast, Oct 07 2010

If 0 is excluded, a(n) gives the possible lengths of the longest string of consecutive divisors of a positive integer: range of values of A055874.
a(n) is the largest number m such that A051451(n) = A003418(m).
From Jianing Song, Nov 01 2023: (Start)
Let q = A000961(n) for n > 1. Then:
 - a(n) is the number of units in the finite field F_q.
 - a(n) is the number of solutions to x*y = t for any t != 0 in F_q.
 - If q is odd, then a(n) is also the number of solutions to x^2 - y^2 = t for any t != 0 in F_q. (End)

			Any integer that is divisible by 5 consecutive integers will be divisible by at least 6 consecutive integers. Hence 5 is not in the sequence.

Matthew House, Table of n, a(n) for n = 1..10000

Cf. A000961, A181063, A181064, A181121.
Includes A006093 as a subsequence.
Cf. A003418, A051451, A055874.

Join[{0}, Select[Range@225, PrimePowerQ] - 1] (* Ivan Neretin, Aug 04 2016 *)

isA181062(n)=ispower(n++,,&n);isprime(n) \\ Charles R Greathouse IV, Jun 29 2011

isok(n) = (n==0) || isprimepower(n++); \\ Michel Marcus, Aug 05 2016

a(n) = A000961(n)-1.

Entry revised by N. J. A. Sloane, Jan 06 2013

A055670 a(n) = prime(n) - (-1)^prime(n).

Original entry on oeis.org

1, 4, 6, 8, 12, 14, 18, 20, 24, 30, 32, 38, 42, 44, 48, 54, 60, 62, 68, 72, 74, 80, 84, 90, 98, 102, 104, 108, 110, 114, 128, 132, 138, 140, 150, 152, 158, 164, 168, 174, 180, 182, 192, 194, 198, 200, 212, 224, 228, 230, 234, 240, 242, 252, 258, 264, 270, 272, 278, 282, 284

Offset: 1

N. J. A. Sloane, Jun 09 2000

Number of right-inequivalent prime Hurwitz quaternions of norm p, where p = n-th rational prime (indexed by A000040).
Two primes are considered right-equivalent if they differ by right multiplication by one of the 24 units. - N. J. A. Sloane
Start of n-th run of consecutive nonprime numbers. Since 2 is the only even prime, for all other prime numbers the expression "- (-1)^(n-th prime)" works out to "+ 1." - Alonso del Arte, Oct 18 2011

			a(1) = 2 - (-1)^2 = 1, a(2) = 3 - (-1)^3 = 4.

L. E. Dickson, Algebras and Their Arithmetics, Dover, 1960, Section 91.
Lynn Arthur Steen and J. Arthur Seebach, Jr., Counterexamples in Topology, Dover, New York, 1978, page 134.

Shawn A. Broyles, Table of n, a(n) for n = 1..20000

Cf. A000040, A006093.
Cf. A055669-A055672.
a(n) = A083503(p) for n>1.

Join[{1},Prime[Range[2,70]]+1] (* Harvey P. Dale, Oct 29 2013 *)

a(n) = prime(n)+1 = A008864(n) for n >= 2. a(n) = A055669(n)/24.

More terms from David W. Wilson, May 02 2001
I would also like to get the sequences of inequivalent prime Hurwitz quaternions, where two primes are considered equivalent if they differ by left or right multiplication by one of the 24 units. This will give two more sequences, analogs of A055670 and A055672.
Edited by N. J. A. Sloane, Aug 16 2009

cp's OEIS Frontend

A084921 a(n) = lcm(p-1, p+1) where p is the n-th prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

SageMath

Formula

A057778 a(n) is the least odd k such that k*2^n + 1 is prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A072668 Numbers one less than composite numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Python

Formula

A084740 Least k such that (n^k-1)/(n-1) is prime, or 0 if no such prime exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A143201 Product of distances between prime factors in factorization of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

A375704 Maximum of the n-th maximal run of adjacent (increasing by one at a time) non-perfect-powers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A377288 Numbers k such that there are exactly two prime-powers between prime(k)+1 and prime(k+1)-1.

Views

Author

Keywords

Comments

Examples

Links