A006549 -id:A006549 - cp's OEIS frontend

A376310 Run-sums of the sequence of first differences of prime-powers.

3, 2, 2, 4, 3, 1, 2, 4, 8, 1, 5, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, 4, 2, 4, 8, 4, 2, 1, 3, 6, 2, 10, 2, 12, 4, 2, 4, 6, 2, 10, 2, 4, 2, 24, 4, 2, 4, 6, 4, 8, 5, 1, 12, 2, 6, 4, 2, 6, 4, 14, 4, 2, 4, 14, 12, 4, 2, 4, 6, 2, 18, 4, 6, 8, 4, 8, 10, 2

Offset: 1

Gus Wiseman, Sep 22 2024

nonn

			The sequence of prime-powers (A246655) is:
  2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, ...
The sequence of first differences (A057820) of prime-powers is:
  1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 4, 2, 2, 2, 2, 1, 5, 4, 2, 4, 2, 4, ...
with runs:
  (1,1,1),(2),(1,1),(2,2),(3),(1),(2),(4),(2,2,2,2),(1),(5),(4),(2),(4), ...
with sums A376310 (this sequence).

For primes instead of prime-powers we have A373822, halved A373823.
For squarefree numbers instead of prime-powers we have A376307.
For compression instead of run-sums we have A376308.
For run-lengths instead of run-sums we have A376309.
For positions of first appearances we have A376341, sorted A376340.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A003242 counts compressed compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A024619 and A361102 list non-prime-powers, first differences A375708.
A116861 counts partitions by compressed sum, by compressed length A116608.
A124767 counts runs in standard compositions, anti-runs A333381.
A238130, A238279, A333755 count compositions by number of runs.
A274174 counts contiguous compositions, ranks A374249.
A373948 encodes compression using compositions in standard order.
Cf. A001597, A006549, A007916, A025475, A037201, A053289, A054265, A110969, A120430, A174965, A251092, A375706.

Total/@Split[Differences[Select[Range[100],PrimePowerQ]]]

A120431 Numbers k such that k and k+2 are prime powers.

Original entry on oeis.org

1, 2, 3, 5, 7, 9, 11, 17, 23, 25, 27, 29, 41, 47, 59, 71, 79, 81, 101, 107, 125, 137, 149, 167, 179, 191, 197, 227, 239, 241, 269, 281, 311, 347, 359, 419, 431, 461, 521, 569, 599, 617, 641, 659, 727, 809, 821, 827, 839, 857, 881, 1019, 1031, 1049, 1061, 1091

Offset: 1

Greg Huber, Jul 13 2006

nonn

Twin prime powers, a generalization of the twin primes. The twin primes are a subsequence.
From Daniel Forgues, Aug 17 2009: (Start)
Numbers k such that k + (0, 2) is a prime power pair.
k + (0, 2m), m >= 1, being an admissible pattern for prime pairs has high density.
k + (0, 2m-1), m >= 1, being a non-admissible pattern for prime pairs, has low density [the only possible pairs are (2^a - 2m-1, 2^a) or (2^a, 2^a + 2m-1), a >= 0.] (End)

			a(5) = 7 since the 5th pair of twin prime powers is (7,9), while the first four pairs are (1,3), (2,4), (3,5) and (5,7).

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1270 from Daniel Forgues)

Cf. A001359, A000961, A064076.

Cf. A006549, A164571, A164572, A164573, A164574.

[1] cat [n: n in [2..1200] | IsPrimePower(n) and IsPrimePower(n+2)]; // Vincenzo Librandi, Nov 03 2018

isppow := proc(n) local pf; pf := ifactors(n)[2]; if nops(pf) = 1 or n =1 then true; else false; fi; end; isA120431 := proc(n) RETURN (isppow(n) and isppow(n+2)); end; for n from 1 to 1500 do if isA120431(n) then printf("%d, ",n); fi; od; # R. J. Mathar, Dec 16 2006

Join[{1}, Select[Range[1100], And@@PrimePowerQ/@{#, # + 2} &]] (* Vincenzo Librandi, Nov 03 2018 *)

is(n)=if(n<4,return(n>0)); isprimepower(n) && isprimepower(n+2) \\ Charles R Greathouse IV, Apr 24 2015

a(n) = A064076(n-2) for n >= 3. - Georg Fischer, Nov 02 2018

More terms from R. J. Mathar, Dec 16 2006

A376341 Position of first appearance of n in A057820, the sequence of first differences of prime-powers, or 0 if n does not appear.

Original entry on oeis.org

1, 5, 10, 13, 19, 25, 199, 35, 118, 48, 28195587, 61, 3745011205066703, 80, 6635, 312, 1079, 207, 3249254387600868788, 179, 43580, 216, 21151968922, 615, 762951923, 403, 1962, 466, 12371, 245, 1480223716, 783, 494890212533313, 1110, 2064590, 1235, 375744164943287809536

Offset: 1

Gus Wiseman, Sep 22 2024

nonn

For odd n either a(n) or a(n)+1 is in A024622 (unless a(n) = 0), corresponding to cases where the smaller or the larger term in the pair of consecutive prime powers, respectively, is a power of 2. - Pontus von Brömssen, Sep 27 2024

			a(4) = 13, because the first occurrence of 4 in A057820 is at index 13. The corresponding first pair of consecutive prime powers with difference 4 is (19, 23), and a(4) = A025528(23) = 13.
a(61) = A024622(96), because the first pair of consecutive prime powers with difference 61 is (2^96, 2^96+61), and A025528(2^96+61) = A024622(96).

Pontus von Brömssen, Table of n, a(n) for n = 1..60

For compression instead of first appearances we have A376308.
For run-lengths instead of first appearances we have A376309.
For run-sums instead of first appearances we have A376310.
For squarefree numbers instead of prime-powers we have A376311.
The sorted version is A376340.
A000040 lists the prime numbers, differences A001223.
A000961 and A246655 list prime-powers, first differences A057820.
A024619 and A361102 list non-prime-powers, first differences A375708.
A003242 counts compressed compositions, ranks A333489.
A005117 lists squarefree numbers, differences A076259.
A116861 counts partitions by compressed sum, by compressed length A116608.
Cf. A001597, A006549, A007916, A024622, A025475, A025528, A037201, A038664, A053289, A110969, A120430, A174965, A373400, A375706.

mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
q=Differences[Select[Range[100],#==1||PrimePowerQ[#]&]];
Table[Position[q,k][[1,1]],{k,mnrm[q]}]

A057820(a(n)) = n whenever a(n) > 0. - Pontus von Brömssen, Sep 24 2024

Definition modified by Pontus von Brömssen, Sep 26 2024

More terms from Pontus von Brömssen, Sep 27 2024

A164572 Numbers k such that k and k+4 are both prime powers.

Original entry on oeis.org

1, 3, 4, 5, 7, 9, 13, 19, 23, 25, 27, 37, 43, 49, 67, 79, 97, 103, 109, 121, 127, 163, 169, 193, 223, 229, 239, 277, 289, 307, 313, 343, 349, 379, 397, 439, 457, 463, 487, 499, 613, 643, 673, 729, 739, 757, 769, 823, 853, 859, 877, 883, 907, 937, 967, 1009, 1087

Offset: 1

Daniel Forgues, Aug 16 2009, Aug 17 2009

nonn

Numbers n such that n + (0, 4) is a prime power pair.
A generalization of the cousin primes. The cousin primes are a subsequence.
n + (0, 2m), m >= 1, being an admissible pattern for prime pairs, since (0, 2m) = (0, 0) (mod 2), has high density.
n + (0, 2m-1), m >= 1, being a non-admissible pattern for prime pairs, since (0, 2m-1) = (0, 1) (mod 2), has low density [the only possible pairs are (2^a - 2m-1, 2^a) or (2^a, 2^a + 2m-1), a >= 0.]

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1256 from Daniel Forgues)

Cf. A023200, A000961.

k and (x) are prime powers: A006549 (k+1), A120431 (k+2), A164571 (k+3), this sequence (k+4), A164573 (k+5), A164574 (k+6).

Select[Range[1000], PrimeNu[#] < 2 && PrimeNu[# + 4] < 2 &] (* Amiram Eldar, Oct 01 2020 *)

is(n)=if(n==1,return(1)); isprimepower(n) && isprimepower(n+4) \\ Charles R Greathouse IV, Apr 24 2015

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

Original entry on oeis.org

2, 5, 6, 10, 11, 12, 13, 14, 17, 18, 19, 20, 21, 22, 23, 28, 29, 30, 33, 34, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88

Offset: 1

Gus Wiseman, Sep 10 2024

nonn

Non-perfect-powers (A007916) are numbers with no proper integer roots.
An anti-run of a sequence is an interval of positions at which consecutive terms differ by more than one.
Also non-perfect-powers x such that x + 1 is also a non-perfect-power.

			The initial anti-runs are the following, whose maxima are a(n):
  (2)
  (3,5)
  (6)
  (7,10)
  (11)
  (12)
  (13)
  (14)
  (15,17)
  (18)
  (19)
  (20)
  (21)
  (22)
  (23)
  (24,26,28)

For nonprime numbers we have A068780, runs A006093 with 2 removed.
For squarefree numbers we have A007674, runs A373415.
For nonsquarefree numbers we have A068781, runs A072284 minus 1 and shifted.
For prime-powers we have A006549, runs A373674.
For non-prime-powers we have A255346, runs A373677.
For anti-runs of non-perfect-powers:
- length: A375736
- first: A375738
- last: A375739 (this)
- sum: A375737
For runs of non-perfect-powers:
- length: A375702
- first: A375703
- last: A375704
- sum: A375705
A001597 lists perfect-powers, differences A053289.
A007916 lists non-perfect-powers, differences A375706.
Cf. A045542, A046933, A053797, A216765, A373576, A373679, 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]&]

A377782 First-differences of A031218(n) = greatest number <= n that is 1 or a prime-power.

Original entry on oeis.org

1, 1, 1, 1, 0, 2, 1, 1, 0, 2, 0, 2, 0, 0, 3, 1, 0, 2, 0, 0, 0, 4, 0, 2, 0, 2, 0, 2, 0, 2, 1, 0, 0, 0, 0, 5, 0, 0, 0, 4, 0, 2, 0, 0, 0, 4, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 6, 0, 2, 0, 0, 3, 0, 0, 3, 0, 0, 0, 4, 0, 2, 0, 0, 0, 0, 0, 6, 0, 2, 0, 2, 0, 0, 0, 0, 0

Offset: 1

Gus Wiseman, Nov 16 2024

nonn

Note 1 is a power of a prime (A000961) but not a prime-power (A246655).

Positions of 1 are A006549.
Positions of 0 are A080765 = A024619 - 1, complement A181062 = A000961 - 1.
Positions of 2 are A120432 (except initial terms).
Sorted positions of first appearances appear to include A167236 - 1.
Positions of terms > 1 are A373677.
The restriction to primes minus 1 is A377289.
Below, A (B) indicates that A is the first-differences of B:
- This sequence is A377782 (A031218), which has restriction to primes A065514 (A377781).
- The opposite is A377780 (A000015), restriction A377703 (A345531).
- For nonsquarefree we have A378036 (A378033), opposite A378039 (A120327).
- For squarefree we have A378085 (A112925), restriction A378038 (A070321).
A000040 lists the primes, differences A001223.
A000961 and A246655 list prime-powers, differences A057820.
A024619 lists the non-prime-powers, differences A375735, seconds A376599.
A361102 lists the non-powers of primes, differences A375708.
A378034 gives differences of A378032 (restriction of A378033).
Prime-powers between primes: A053607, A080101, A366833, A377057, A377286, A377287.
Cf. A053289, A343249, A375706, A377281, A377282.

Differences[Table[NestWhile[#-1&,n,#>1&&!PrimePowerQ[#]&],{n,100}]]

A059958 Smallest number m such that m*(m+1) has at least n distinct prime factors.

Original entry on oeis.org

1, 2, 5, 14, 65, 209, 714, 7314, 38570, 254540, 728364, 11243154, 58524465, 812646120, 5163068910, 58720148850, 555409903685, 4339149420605, 69322940121435, 490005293940084, 5819629108725509, 76622240600506314

Offset: 1

Labos Elemer, Mar 02 2001

The original definition left unclear whether "at least" or "exactly" n prime factors are required. Now the "at least" variant was chosen, for the other variant ("exactly"), see A069354: At least up to a(18), both criteria yield the same number, and therefore a(n) = A069354(n) - 1, since m and m+1 are always coprime. - M. F. Hasler, Jan 15 2014
10^13 < a(19) <= 69322940121435. - Giovanni Resta, Mar 24 2020
Terms a(1)-a(10) appear in Erdős and Nicolas (1978-1979). - Amiram Eldar, Jun 24 2023

			For n = 9, a(9)*(a(9) + 1) = 38570*38571 = (2*5*7*19*29)*(3*13*23*43) with 9 distinct prime factors.

Michael S. Branicky, Python program.
Paul Erdős and Jean-Louis Nicolas, Sur la fonction "nombre de facteurs premiers de n", Séminaire Delange-Pisot-Poitou, Théorie des nombres, Vol. 20, No. 2 (1978-1979), Talk no. 32, pp. 1-19. See p. 10.

Cf. A001221, A002110, A006549, A054989, A083002, A232096, A232097.

With[{s = Map[PrimeNu[Times @@ #] &, Partition[Range[10^6], 2, 1]]}, Array[FirstPosition[s, n_/; n>=#][[1]] &, Max@ s]] (* Michael De Vlieger, Nov 02 2017 *)

a(n) = my(m=1); while(omega(m*(m+1)) < n, m++); m; \\ Michel Marcus, Jul 09 2018

a(n) = Min_{ m | A001221(m*(m+1)) >= n }.
a(n) <= A002110(n) - 1 because A001221((q-1)*q) >= n+1 for q = A002110(n).
Conjecture: a(n) = A069354(n) - 1. - Robert G. Wilson v, Feb 18 2014

More terms from William Rex Marshall, Mar 18 2001
Offset corrected and a(15)-a(16) from Donovan Johnson, Jan 31 2009
a(17) from Donovan Johnson, Sep 15 2010
a(18) from Don Reble, Jan 15 2014
Edited by M. F. Hasler, Jan 15 2014
a(19)-a(20) from Michael S. Branicky, Feb 08 2023
a(21) from Michael S. Branicky, Feb 10 2023
a(22) from Michael S. Branicky, Feb 23 2023

A164571 Numbers n such that n and n+3 are prime powers.

Original entry on oeis.org

1, 2, 4, 5, 8, 13, 16, 29, 61, 64, 125, 128, 509, 1021, 4093, 4096, 16381, 32768, 65536, 262144, 1048573, 4194301, 16777213, 268435456, 536870909, 1073741824, 36028797018963968

Offset: 1

Daniel Forgues, Aug 16 2009

nonn

Numbers n such that n + (0, 3) is a prime power pair.
n + (0, 2m), m >= 1, being an admissible pattern for prime pairs, since (0, 2m) = (0, 0) (mod 2), has high density.
n + (0, 2m-1), m >= 1, being a non-admissible pattern for prime pairs, since (0, 2m-1) = (0, 1) (mod 2), has low density [the only possible pairs are (2^a - 2m-1, 2^a) or (2^a, 2^a + 2m-1), a >= 0.]
n + (0, 3) being a non-admissible pattern for prime pairs, has only prime power pairs (2^a - 3, 2^a) or (2^a, 2^a + 3), a >= 0.
Numbers n such that n and n+3 are primes would give only 2, for the prime pair (2, 5).
10^18 < a(28) <= 19807040628566084398385987581. - Donovan Johnson, Aug 17 2009

Charles R Greathouse IV, Table of n, a(n) for n = 1..50

Cf. A000961.
Cf. A006549 Numbers n such that n and n+1 are prime powers.
Cf. A120431 Numbers n such that n and n+2 are prime powers.
Cf. A164571 Numbers n such that n and n+3 are prime powers.
Cf. A164572 Numbers n such that n and n+4 are prime powers.
Cf. A164573 Numbers n such that n and n+5 are prime powers.
Cf. A164574 Numbers n such that n and n+6 are prime powers.

ispp(n) = (n==1) || isprime(n) || (ispower(n, ,&p) && isprime(p));
isok(n) = ispp(n) && ispp(n+3); \\ Michel Marcus, Aug 31 2013

v=List(); for(n=0, 1e3, if(isprimepower(2^n-3), listput(v, 2^n-3)); if(isprimepower(2^n+3), listput(v, 2^n))); Set(v) \\ Charles R Greathouse IV, Apr 24 2015

Edited by Daniel Forgues, Aug 17 2009

a(20)-a(27) from Donovan Johnson, Aug 17 2009

A164573 Numbers n such that n and n+5 are prime powers.

Original entry on oeis.org

2, 3, 4, 8, 11, 27, 32, 59, 251, 1019, 2048, 4091, 262139, 1048571, 67108859, 4294967291, 68719476731, 140737488355328, 9007199254740992, 72057594037927931, 73786976294838206459, 332306998946228968225951765070086139

Offset: 1

Daniel Forgues, Aug 16 2009

nonn

Numbers n such that n + (0, 5) is a prime power pair.
n + (0, 2m), m >= 1, being an admissible pattern for prime pairs, since (0, 2m) = (0, 0) (mod 2), has high density.
n + (0, 2m-1), m >= 1, being a non-admissible pattern for prime pairs, since (0, 2m-1) = (0, 1) (mod 2), has low density [the only possible pairs are (2^a - 2m-1, 2^a) or (2^a, 2^a + 2m-1), a >= 0.]
Numbers n such that n and n+5 are primes would give only 2, for the prime pair (2, 7).
10^18 < a(21) <= 73786976294838206459. - Donovan Johnson, Aug 17 2009

Charles R Greathouse IV, Table of n, a(n) for n = 1..37

Cf. A006549 Numbers n such that n and n+1 are prime powers.
Cf. A120431 Numbers n such that n and n+2 are prime powers.
Cf. A164571 Numbers n such that n and n+3 are prime powers.
Cf. A164572 Numbers n such that n and n+4 are prime powers.
Cf. A164573 Numbers n such that n and n+5 are prime powers.
Cf. A164574 Numbers n such that n and n+6 are prime powers.

is(n)=if(n<5,return(n>1)); isprimepower(n) && isprimepower(n+5) \\ Charles R Greathouse IV, Apr 24 2015

v=List();for(n=0,1e3,if(isprimepower(2^n-5),listput(v,2^n-5));if(isprimepower(2^n+5),listput(v,2^n))); Set(v) \\ Charles R Greathouse IV, Apr 24 2015

Edited by Daniel Forgues, Aug 17 2009
a(13)-a(20) from Donovan Johnson, Aug 17 2009
a(21)-a(22) from Charles R Greathouse IV, Apr 24 2015

A164574 Numbers k such that k and k+6 are both prime powers.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 31, 37, 41, 43, 47, 53, 61, 67, 73, 83, 97, 101, 103, 107, 121, 125, 131, 151, 157, 163, 167, 173, 191, 193, 223, 227, 233, 251, 257, 263, 271, 277, 283, 307, 311, 331, 337, 343, 347, 353, 361, 367, 373, 383, 433, 443, 457

Offset: 1

Daniel Forgues, Aug 16 2009

nonn

Numbers n such that n + (0, 6) is a prime power pair.
n + (0, 2m), m >= 1, being an admissible pattern for prime pairs, since (0, 2m) = (0, 0) (mod 2), has high density.
n + (0, 2m-1), m >= 1, being a non-admissible pattern for prime pairs, since (0, 2m-1) = (0, 1) (mod 2), has low density [the only possible pairs are (2^a - 2m-1, 2^a) or (2^a, 2^a + 2m-1), a >= 0.]

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..2492 from Daniel Forgues)

Cf. A023201, A000961.

k and (x) are prime powers: A006549 (k+1) A120431 (k+2), A164571 (k+3), A164572 (k+4), A164573 (k+5), this sequence (k+6).

Join[{1},Select[Range[500],AllTrue[{#,#+6},PrimePowerQ]&]] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Sep 30 2018 *)

is(n)=if(n<4,return(n>0)); isprimepower(n) && isprimepower(n+6) \\ Charles R Greathouse IV, Apr 24 2015

Edited by Daniel Forgues, Aug 17 2009

cp's OEIS Frontend

A376310 Run-sums of the sequence of first differences of prime-powers.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A120431 Numbers k such that k and k+2 are prime powers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A376341 Position of first appearance of n in A057820, the sequence of first differences of prime-powers, or 0 if n does not appear.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A164572 Numbers k such that k and k+4 are both prime powers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

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

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A377782 First-differences of A031218(n) = greatest number <= n that is 1 or a prime-power.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

A059958 Smallest number m such that m*(m+1) has at least n distinct prime factors.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A164571 Numbers n such that n and n+3 are prime powers.

Views

Author

Keywords