A025475 -id:A025475 - cp's OEIS frontend

A355526 Maximal difference between adjacent prime indices of n, or k if n is the k-th prime.

1, 2, 0, 3, 1, 4, 0, 0, 2, 5, 1, 6, 3, 1, 0, 7, 1, 8, 2, 2, 4, 9, 1, 0, 5, 0, 3, 10, 1, 11, 0, 3, 6, 1, 1, 12, 7, 4, 2, 13, 2, 14, 4, 1, 8, 15, 1, 0, 2, 5, 5, 16, 1, 2, 3, 6, 9, 17, 1, 18, 10, 2, 0, 3, 3, 19, 6, 7, 2, 20, 1, 21, 11, 1, 7, 1, 4, 22, 2, 0, 12

Offset: 2

Gus Wiseman, Jul 10 2022

nonn

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The prime indices of 9842 are {1,4,8,12}, with differences (3,4,4), so a(9842) = 4.

Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.

Crossrefs found in the link are not repeated here.
Positions of first appearances are 4 followed by A000040.
Positions of 0's are A025475, minimal version A013929.
Positions of 1's are 2 followed by A066312, minimal version A355527.
Triangle A238710 counts m such that A056239(m) = n and a(m) = k.
Prepending 0 to the prime indices gives A286469, minimal version A355528.
See also A286470, minimal version A355524.
The minimal version is A355525, triangle A238709.
The augmented version is A355532.
A001522 counts partitions with a fixed point (unproved), ranked by A352827.
A287352, A355533, A355534, A355536 list the differences of prime indices.
Cf. A000005, A047966, A091602, A238353, A279945, A325160, A325161, A352822, A351294, A355530.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[If[PrimeQ[n],PrimePi[n],Max@@Differences[primeMS[n]]],{n,2,100}]

A377052 Antidiagonal-sums of the array A377051(n,k) = n-th term of k-th differences of powers of primes.

Original entry on oeis.org

1, 3, 4, 5, 6, 13, -6, 45, -50, 113, -98, 73, 274, -1159, 3563, -8707, 19024, -36977, 64582, -98401, 121436, -81961, -147383, 860871, -2709964, 7110655, -17077217, 38873213, -85085216, 179965720, -367884935, 725051361, -1372311916, 2481473639, -4257624155

Offset: 0

Gus Wiseman, Oct 22 2024

sign

These are the row-sums of the triangle-version of A377051.

			The sixth antidiagonal of A377051 is (8, 1, -1, -2, -3, -4, -5), so a(6) = -6.

The version for primes is A140119, noncomposites A376683, composites A377034.
For squarefree numbers we have A377039, nonsquarefree A377047.
These are the antidiagonal-sums of A377051.
The unsigned version is A377053.
For leaders we have A377054, for primes A007442 or A030016.
For first zero-positions we have A377055.
A version for partitions is A377056, cf. A175804, A053445, A281425, A320590.
A000040 lists the primes, differences A001223, seconds A036263.
A001597 lists perfect-powers, complement A007916.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
Cf. A000961, A025475, A053707, A057820, A093555, A174965, A246655, A361102, A376340, A376596, A376598.

nn=20;
t=Table[Differences[NestList[NestWhile[#+1&, #+1,!PrimePowerQ[#]&]&,1,2*nn],k],{k,0,nn}];
Total/@Table[t[[j,i-j+1]],{i,nn},{j,i}]

A377053 Antidiagonal-sums of the absolute value of the array A377051(n,k) = n-th term of k-th differences of powers of primes.

Original entry on oeis.org

1, 3, 4, 5, 6, 13, 24, 45, 80, 123, 174, 229, 382, 1219, 3591, 8849, 19288, 37899, 67442, 108323, 156054, 206733, 311525, 860955, 2710374, 7111657, 17080759, 38884849, 85124764, 180097856, 368321633, 726482493, 1377039690, 2496856437, 4306569569, 7016267449

Offset: 0

Gus Wiseman, Oct 22 2024

nonn

These are the row-sums of the absolute value of the triangle-version of A377051.

			The sixth antidiagonal of A377051 is (8, 1, -1, -2, -3, -4, -5), so a(6) = 24.

The version for primes is A376681, noncomposites A376684, composites A377035.
For squarefree numbers we have A377040, nonsquarefree A377048.
This is the antidiagonal-sums of the absolute value of A377051.
The signed version is A377052.
For leaders we have A377054, for primes A007442 or A030016.
For first zero-positions we have A377055.
A version for partitions is A377056, cf. A175804, A053445, A281425, A320590.
A000040 lists the primes, differences A001223, seconds A036263.
A008578 lists the noncomposites, differences A075526.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
Cf. A000961, A025475, A053707, A057820, A069623, A093555, A174965, A246655, A361102, A376340, A376596.

nn=20;
t=Table[Differences[NestList[NestWhile[#+1&, #+1,!PrimePowerQ[#]&]&,1,2*nn],k],{k,0,nn}];
Total/@Abs[Table[t[[j,i-j+1]],{i,nn},{j,i}]]

A377055 Position of first appearance of zero in the n-th differences of the prime-powers (A246655), or 0 if it does not appear.

Original entry on oeis.org

0, 0, 1, 1, 4, 48, 61, 83, 29, 57, 290, 121, 7115, 14207, 68320, 14652, 149979, 122704, 481540, 980376, 632441, 29973, 25343678, 50577935, 7512418, 210836403, 67253056, 224083553, 910629561, 931524323, 452509699, 2880227533, 396690327, 57954538325, 77572935454, 35395016473

Offset: 0

Gus Wiseman, Oct 22 2024

nonn

			The fourth differences of A246655 begin: 1, -3, 3, 0, -2, 2, ... so a(4) = 4.

Lucas A. Brown, Python program.

The version for primes is A376678, noncomposites A376855, composites A377037.
For squarefree numbers we have A377042, nonsquarefree A377050.
These are the positions of first zeros in each row of A377051.
For antidiagonal-sums we have A377052, absolute A377053.
For leaders we have A377054, for primes A007442 or A030016.
A000040 lists the primes, differences A001223, seconds A036263.
A000961 lists the powers of primes, differences A057820.
A008578 lists the noncomposites, differences A075526.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
A246655 lists the prime-powers, differences A057820 (except first term).
Cf. A025475, A053707, A093555, A174965, A175804, A361102, A376340, A376596, A377056.

nn=10000;
u=Table[Differences[Select[Range[nn],PrimePowerQ],k],{k,2,16}];
mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
m=Table[Position[u[[k]],0][[1,1]], {k,mnrm[Union[First/@Position[u,0]]]}]

a(12)-a(27) from Pontus von Brömssen, Oct 22 2024
a(28)-a(30) from Chai Wah Wu, Oct 23 2024
a(31)-a(35) from Lucas A. Brown, Nov 03 2024

A134616 Numbers such that the sum of squares of their prime factors (taken with multiplicity) is a prime.

Original entry on oeis.org

6, 10, 12, 14, 26, 34, 40, 45, 54, 56, 63, 74, 75, 80, 90, 94, 96, 99, 104, 105, 126, 134, 146, 147, 152, 153, 171, 176, 184, 194, 206, 207, 231, 232, 234, 250, 261, 273, 274, 296, 300, 306, 326, 328, 334, 342, 344, 345, 350, 357, 363, 369, 376, 384, 386, 387

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(2)=10, since 10=2*5 and 2^2+5^2=29 which is prime.

Hieronymus Fischer, Table of n, a(n) for n = 1..10000

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134612, A134619, A134621.

f[{a_,b_}]:=Table[a,b];Select[Range[2,387],PrimeQ[ Total[Flatten[(f/@FactorInteger[#])^2]] ]&] (* James C. McMahon, Apr 09 2025 *)

Minor edits by the author, May 06 2013

A376560 Points of upward concavity in the sequence of perfect-powers (A001597). Positives of A376559.

Original entry on oeis.org

1, 3, 4, 6, 8, 9, 10, 11, 12, 15, 16, 17, 20, 22, 23, 26, 27, 28, 31, 32, 33, 34, 35, 36, 37, 38, 41, 42, 43, 44, 46, 47, 48, 49, 50, 53, 54, 55, 57, 58, 60, 61, 62, 63, 64, 65, 67, 68, 69, 72, 73, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 88, 89, 90, 91

Offset: 1

Gus Wiseman, Sep 30 2024

nonn

These are points at which the second differences are positive.
Perfect-powers (A001597) are numbers with a proper integer root.
Note that, for some sources, upward concavity is negative curvature.

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, 33, ...
with first differences (A376559):
  1, -3, 6, 2, -7, 3, -1, 9, 2, 2, 2, 2, -17, -1, 13, 9, 2, -7, -11, 9, -5, 20, 2, ...
with positive positions (A376560):
  1, 3, 4, 6, 8, 9, 10, 11, 12, 15, 16, 17, 20, 22, 23, 26, 27, 28, 31, 32, 33, 34, ...

Robert Israel, Table of n, a(n) for n = 1..10000
Gus Wiseman, Points of upward concavity in the perfect-powers.

The version for A000002 is A022297, complement A025505. See also A054354, A376604.
For first differences we have A053289, union A023055, firsts A376268, A376519.
For primes instead of perfect-powers we have A258025.
These are positions of positive terms in A376559.
For downward concavity we have A376561 (probably the complement).
A001597 lists the perfect-powers.
A064113 lists positions of adjacent equal prime gaps.
A333254 gives run-lengths of differences between consecutive primes.
Second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376596 (prime-power), A376599 (non-prime-power).
Cf. A006549, A025475, A030173, A045542, A052410, A053707, A054819, A069623, A174965, A216765, A251092, A376308.

N:= 10^6: # to use perfect powers <= N
S:= {1,seq(seq(i^j,j=2..floor(log[i](N))),i=2..isqrt(N))}:
L:= sort(convert(S,list)):
DL:= L[2..-1]-L[1..-2]:
D2L:= DL[2..-1]-DL[1..-2]:
select(i -> D2L[i]>0, [$1..nops(D2L)]); # Robert Israel, Dec 01 2024

perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
Join@@Position[Sign[Differences[Select[Range[1000],perpowQ],2]],1]

A376654 Sorted positions of first appearances in the second differences of consecutive prime-powers exclusive (A246655).

Original entry on oeis.org

3, 4, 9, 11, 17, 24, 44, 46, 47, 59, 67, 68, 70, 79, 117, 120, 177, 178, 198, 205, 206, 215, 243, 244, 303, 324, 326, 401, 465, 483, 604, 800, 879, 938, 1032, 1054, 1076, 1233, 1280, 1720, 1889, 1890, 1905, 1939, 1959, 1961, 2256, 2289, 2409, 2879, 3149

Offset: 1

Gus Wiseman, Oct 06 2024

nonn

			The prime-powers exclusive (A246655) are:
  2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, ...
with first differences (A057820 except first term) :
  1, 1, 1, 2, 1, 1, 2, 2, 3, 1, 2, 4, 2, 2, 2, 2, 1, 5, 4, 2, 4, 2, 4, 6, 2, 3, 3, ...
with first differences (A376596 except first term):
  0, 0, 1, -1, 0, 1, 0, 1, -2, 1, 2, -2, 0, 0, 0, -1, 4, -1, -2, 2, -2, 2, 2, -4, ...
with first appearances (A376654):
  1, 3, 4, 9, 11, 17, 24, 44, 46, 47, 59, 67, 68, 70, 79, 117, 120, 177, 178, 198, ...

For first differences we have A376340.
These are the sorted positions of first appearances in A376596 except first term.
The inclusive version is a(n) + 1 = A376653(n), except first term.
For squarefree instead of prime-power we have A376655.
A000961 lists prime-powers inclusive, exclusive A246655.
A001597 lists perfect-powers, complement A007916.
A023893 and A023894 count integer partitions into prime-powers, factorizations A000688.
For prime-powers inclusive: A057820 (first differences), A376597 (inflections and undulations), A376598 (nonzero curvature).
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376599 (non-prime-power).
Cf. A025475, A053707, A057820, A064113, A069623, A093555, A174965, A333254, A336416, A361102.

q=Differences[Select[Range[1000],PrimePowerQ[#]&],2];
Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

A134618 Numbers such that the sum of cubes of their prime factors (taken with multiplicity) is a prime.

Original entry on oeis.org

12, 28, 40, 45, 48, 52, 54, 56, 63, 75, 80, 96, 104, 108, 117, 136, 152, 153, 165, 175, 210, 224, 232, 245, 250, 261, 268, 300, 320, 325, 333, 344, 350, 363, 384, 387, 390, 399, 405, 416, 432, 462, 464, 468, 475, 477, 504, 507, 531, 536, 539, 561, 570, 584

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

			a(2) = 28, since 28 = 2*2*7 and 2^3 + 2^3 + 7^3 = 359 which is prime.

Harvey P. Dale and Hieronymus Fischer, Table of n, a(n) for n = 1..10000 (first 1000 terms from _Harvey P. Dale_)

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134612, A134616, A134620.

Select[Range[600],PrimeQ[Total[Flatten[Table[#[[1]],{#[[2]]}]&/@ FactorInteger[#]]^3]]&] (* Harvey P. Dale, Feb 01 2013 *)

from sympy import factorint, isprime
def ok(n): return isprime(sum(p**3 for p in factorint(n, multiple=True)))
print([k for k in range(585) if ok(k)]) # Michael S. Branicky, Dec 28 2021

{k: A224787(k) in A000040}. - R. J. Mathar, Mar 25 2025

Example clarified by Harvey P. Dale, Feb 01 2013

Minor edits by Hieronymus Fischer, May 06 2013

A134620 Numbers such that the sum of 4th power of their prime factors is a prime.

Original entry on oeis.org

6, 10, 12, 14, 22, 34, 38, 40, 45, 46, 74, 82, 117, 118, 122, 126, 142, 152, 158, 171, 194, 231, 262, 278, 296, 345, 358, 363, 376, 384, 387, 429, 432, 446, 454, 458, 482, 486, 490, 500, 507, 522, 536, 550, 566, 584, 626, 627, 634, 639, 663, 675, 686, 704, 705

Offset: 1

Hieronymus Fischer, Nov 11 2007

nonn

Prime factors must be taken with multiplicity. - Harvey P. Dale, May 23 2012

The calculation of higher terms is time-consuming, since for any number of the form 2*p with a prime number p > 10^5 the primality test have to be accomplished for a number > 10^20. - Hieronymus Fischer, May 21 2013

			a(2) = 10, since 10 = 2*5 and 2^4+5^4 = 641 which is prime.
a(9) = 45, since 45 = 3*3*5 and 3^4+3^4+5^4 = 787 which is prime.
a(9883) = 333314, since 333314 = 3*166657 and 2^4+166657^4 = 771425941499397811217 which is prime.

Harvey P. Dale and Hieronymus Fischer, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale)

Cf. A001597, A025475, A134333, A134344, A134376.

Cf. A134600, A134602, A134605, A134608, A134612, A134616, A134618, A134621.

Select[Range[1000],PrimeQ[Total[Flatten[Table[First[#],{Last[#]}]&/@ FactorInteger[#]]^4]]&] (* Harvey P. Dale, May 23 2012 *)

A376309 Run-lengths of the sequence of first differences of prime-powers.

Original entry on oeis.org

3, 1, 2, 2, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 1, 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 lengths A376309 (this sequence).

Antti Karttunen, Table of n, a(n) for n = 1..20000

For runs of prime-powers increasing by one we have A174965.
For primes instead of prime-powers we have A333254.
For squarefree numbers instead of prime-powers we have A376306.
For compression instead of run-lengths we have A376308.
For run-sums instead of run-lengths we have A376310.
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, A025475, A037201, A053289, A110969, A120430, A251092, A373822, A375706.

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

up_to = 20000;
A376309list(up_to) = { my(v=vector(up_to), ppp=2, pd=1, d, rl=0, k=2, i=0); while(i<#v, k++; if(isprimepower(k), d = k-ppp; ppp = k; if(d == pd, rl++, i++; v[i] = rl; rl = 1; pd = d))); (v); };
v376309 = A376309list(up_to);
A376309(n) = v376309[n]; \\ Antti Karttunen, Jan 18 2025

More terms from Antti Karttunen, Jan 18 2025

cp's OEIS Frontend

A355526 Maximal difference between adjacent prime indices of n, or k if n is the k-th prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A377052 Antidiagonal-sums of the array A377051(n,k) = n-th term of k-th differences of powers of primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A377053 Antidiagonal-sums of the absolute value of the array A377051(n,k) = n-th term of k-th differences of powers of primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A377055 Position of first appearance of zero in the n-th differences of the prime-powers (A246655), or 0 if it does not appear.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A134616 Numbers such that the sum of squares of their prime factors (taken with multiplicity) is a prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A376560 Points of upward concavity in the sequence of perfect-powers (A001597). Positives of A376559.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A376654 Sorted positions of first appearances in the second differences of consecutive prime-powers exclusive (A246655).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A134618 Numbers such that the sum of cubes of their prime factors (taken with multiplicity) is a prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

Extensions