A050997 -id:A050997 - cp's OEIS frontend

A369969 Numbers that are not multiples of 5, but their arithmetic derivative is.

1, 6, 21, 26, 32, 36, 46, 51, 76, 86, 88, 91, 99, 106, 111, 112, 116, 126, 141, 146, 156, 161, 166, 192, 201, 206, 209, 216, 221, 226, 236, 242, 243, 248, 266, 272, 276, 279, 291, 301, 306, 308, 316, 319, 321, 326, 328, 346, 356, 369, 371, 381, 386, 391, 392, 406, 411, 429, 436, 441, 446, 456, 466, 471, 481, 488, 501

Offset: 1

Antti Karttunen, Feb 10 2024

nonn

Robert Israel, Table of n, a(n) for n = 1..10000

Intersection of A047201 and A327865.
Includes A050997 \ {3125} as a subsequence.
Cf. A003415, A369968 (characteristic function).
Cf. also A046337, A369659, A360110 for cases k=2, 3, 4 of "Nonmultiples of k whose arithmetic derivative is a multiple of k".

filter:= proc(n) local F, np, t;
  if n mod 5 = 0 then return false fi;
  F:= ifactors(n)[2];
  np:= add(n*t[2]/t[1],t=F);
  np mod 5 = 0
end proc:
select(filter, [$1..1000]); # Robert Israel, Dec 05 2024

PARI
```
\\ See A369968.
```

A382292 Numbers k such that A382290(k) = 1.

Original entry on oeis.org

8, 24, 27, 32, 40, 54, 56, 64, 72, 88, 96, 104, 108, 120, 125, 135, 136, 152, 160, 168, 184, 189, 192, 200, 224, 232, 243, 248, 250, 264, 270, 280, 288, 296, 297, 312, 320, 328, 343, 344, 351, 352, 360, 375, 376, 378, 392, 408, 416, 424, 432, 440, 448, 456, 459, 472, 480, 486, 488, 500

Offset: 1

Amiram Eldar, Mar 21 2025

First differs from A374590 and A375432 at n = 25: A374590(25) = A375432(25) = 216 is not a term of this sequence.
Numbers k such that A382291(k) = 2, i.e., numbers whose number of infinitary divisors is twice the number of their unitary divisors.
Numbers whose prime factorization has a single exponent that is a sum of two distinct powers of 2 (A018900) and all the other exponents, if they exist, are powers of 2. Equivalently, numbers of the form p^e * m, where p is a prime, e is a term in A018900, and m is a term in A138302 that is coprime to p.
If k is a term then k^2 is also a term. If m is a term in A138302 that is coprime to k then k * m is also a term. The primitive terms, i.e., the terms that cannot be generated from smaller terms using these rules, are the numbers of the form p^(2^i+1), where p is prime and i >= 1.
Analogous to A060687, which is the sequence of numbers k with prime excess A046660(k) = 2.
The asymptotic density of this sequence is A271727 * Sum_{p prime} (((1 - 1/p)/f(1/p)) * Sum_{k>=1} 1/p^A018900(k)) = 0.11919967112489084407..., where f(x) = 1 - x^3 + Sum_{k>=2} (x^(2^k)-x^(2^k+1)).

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A018900, A046660, A060687, A271727, A374590, A375432, A382290, A382291.

Subsequences (numbers of the form): A030078 (p^3), A050997 (p^5), A030516 (p^6), A179665 (p^9), A030629 (p^10), A030631 (p^12), A065036 (p^3*q), A178740 (p^5*q), A189987 (p^6*q), A179692 (p^9*q), A143610 (p^2*q^3), A179646 (p^5*q^2), A189990 (p^2*q^6), A179702 (p^4*q^5), A179666 (p^4*q^3), A190464 (p^4*q^6), A163569 (p^3*q^2*r), A189975 (p*q*r^3), A190115 (p^2*q^3*r^4), A381315, A048109.

f[p_, e_] := DigitCount[e, 2, 1] - 1; q[1] = False; q[n_] := Plus @@ f @@@ FactorInteger[n] == 1; Select[Range[500], q]

isok(k) = vecsum(apply(x -> hammingweight(x) - 1, factor(k)[, 2])) == 1;

A275345 Characteristic polynomials of a square matrix based on A051731 where A051731(1,N)=1 and A051731(N,N)=0 and where N=size of matrix, analogous to the Redheffer matrix.

Original entry on oeis.org

1, 1, -1, -1, -1, 1, -1, 0, 2, -1, 0, 0, 2, -3, 1, -1, 2, 1, -5, 4, -1, 1, -3, 5, -8, 9, -5, 1, -1, 4, -4, -5, 15, -14, 6, -1, 0, -1, 6, -17, 29, -31, 20, -7, 1, 0, 0, 2, -13, 36, -55, 50, -27, 8, -1, 1, -7, 23, -50, 84, -112, 112, -78, 35, -9, 1

Offset: 0

Mats Granvik, Jul 24 2016

From Mats Granvik, Sep 30 2017: (Start)
Conjecture: The largest absolute value of the eigenvalues of these characteristic polynomials appear to have the same prime signature in the factorization of the matrix sizes N.
In other words: Let b(N) equal the sequence of the largest absolute values of the eigenvalues of the characteristic polynomials of the matrices of size N. b(N) is then a sequence of truncated eigenvalues starting:
b(N=1..infinity)
= 1.00000, 1.61803, 1.61803, 2.00000, 1.61803, 2.20557, 1.61803, 2.32472, 2.00000, 2.20557, 1.61803, 2.67170, 1.61803, 2.20557, 2.20557, 2.61803, 1.61803, 2.67170, 1.61803, 2.67170, 2.20557, 2.20557, 1.61803, 3.08032, 2.00000, 2.20557, 2.32472, 2.67170, 1.61803, 2.93796, 1.61803, 2.89055, 2.20557, 2.20557, 2.20557, 3.21878, 1.61803, 2.20557, 2.20557, 3.08032, 1.61803, 2.93796, 1.61803, 2.67170, 2.67170, 2.20557, 1.61803, 3.45341, 2.00000, 2.67170, 2.20557, 2.67170, 1.61803, 3.08032, 2.20557, 3.08032, 2.20557, 2.20557, 1.61803, 3.53392, 1.61803, 2.20557, 2.67170, ...
It then appears that for n = 1,2,3,4,5,...,infinity we have the table:
Prime signature: b(Axxxxxx(n)) = Largest abs(eigenvalue):
p^0      : b(1)          = 1.0000000000000000000000000000...
p        : b(A000040(n)) = 1.6180339887498949025257388711...
p^2      : b(A001248(n)) = 2.0000000000000000000000000000...
p*q      : b(A006881(n)) = 2.2055694304005917238953315973...
p^3      : b(A030078(n)) = 2.3247179572447480566665944934...
p^2*q    : b(A054753(n)) = 2.6716998816571604358216518448...
p^4      : b(A030514(n)) = 2.6180339887498917939012699207...
p^3*q    : b(A065036(n)) = 3.0803227214906021558249449299...
p*q*r    : b(A007304(n)) = 2.9379558827528557962693867011...
p^5      : b(A050997(n)) = 2.8905508875432590620846440288...
p^2*q^2  : b(A085986(n)) = 3.2187765853016649941764626419...
p^4*q    : b(A178739(n)) = 3.4534111136673804054453285061...
p^2*q*r  : b(A085987(n)) = 3.5339198574905377192578725953...
p^6      : b(A030516(n)) = 3.1478990357047909043330946587...
p^3*q^2  : b(A143610(n)) = 3.7022736187975437971431347250...
p^5*q    : b(A178740(n)) = 3.8016448153137023524550386355...
p^3*q*r  : b(A189975(n)) = 4.0600260453688532535920785448...
p^7      : b(A092759(n)) = 3.3935083220984414431597997463...
p^4*q^2  : b(A189988(n)) = 4.1453038440113498808159420150...
p^2*q^2*r: b(A179643(n)) = 4.2413382309993874486053755390...
p^6*q    : b(A189987(n)) = 4.1311805192254587026923218218...
p*q*r*s  : b(A046386(n)) = 3.8825338629275134572083061357...
...
b(Axxxxxx(1)) in the sequences above, is given by A025487.
(End)
First column in the coefficients of the characteristic polynomials is the Möbius function A008683.
Row sums of coefficients start: 0, -1, 0, 0, 0, 0, 0, 0, 0, ...
Third diagonal is a signed version of A000096.
Most of the eigenvalues are equal to 1. The number of eigenvalues equal to 1 are given by A075795 for n>1.
The first three of the eigenvalues above can be calculated as nested radicals. The fourth eigenvalue 2.205569430400590... minus 1 = 1.205569430400590... is also a nested radical.

			{
{ 1},
{ 1, -1},
{-1, -1,  1},
{-1,  0,  2,  -1},
{ 0,  0,  2,  -3,  1},
{-1,  2,  1,  -5,  4,   -1},
{ 1, -3,  5,  -8,  9,   -5,   1},
{-1,  4, -4,  -5, 15,  -14,   6,  -1},
{ 0, -1,  6, -17, 29,  -31,  20,  -7,  1},
{ 0,  0,  2, -13, 36,  -55,  50, -27,  8, -1},
{ 1, -7, 23, -50, 84, -112, 112, -78, 35, -9, 1}
}

Mats Granvik, Mathematica program to verify that eigenvalues determine prime signature
OEIS Wiki, Prime signatures
Eric Weisstein, Prime signature
Index to sequences related to prime signature

Cf. A051731, A008683, A000040, A001248, A006881, A030078, A030514, A054753, A000096, A001622, A272874, A075795.

Cf. A025487. - Mats Granvik, Sep 30 2017

Clear[x, AA, nn, s]; Monitor[AA = Flatten[Table[A = Table[Table[If[Mod[n, k] == 0, 1, 0], {k, 1, nn}], {n, 1, nn}]; MatrixForm[A]; a = A[[1, nn]]; A[[1, nn]] = A[[nn, nn]]; A[[nn, nn]] = a; CoefficientList[CharacteristicPolynomial[A, x], x], {nn, 1, 10}]], nn]

A304203 If n = Product (p_j^k_j) then a(n) = Product (p_j^prime(k_j)).

Original entry on oeis.org

1, 4, 9, 8, 25, 36, 49, 32, 27, 100, 121, 72, 169, 196, 225, 128, 289, 108, 361, 200, 441, 484, 529, 288, 125, 676, 243, 392, 841, 900, 961, 2048, 1089, 1156, 1225, 216, 1369, 1444, 1521, 800, 1681, 1764, 1849, 968, 675, 2116, 2209, 1152, 343, 500, 2601, 1352, 2809, 972, 3025

Offset: 1

Ilya Gutkovskiy, May 09 2018

			a(12) = a(2^2*3^1) = 2^prime(2)*3^prime(1) = 2^3*3^2 = 72.

Andrew Howroyd, Table of n, a(n) for n = 1..1000
Ilya Gutkovskiy, Scatter plot of a(n) up to n=50000.
Index entries for sequences computed from exponents in factorization of n.

Cf. A000040, A001248, A002110, A003963, A008477, A030078, A048767, A050997, A056166 (records), A061742, A181819.

Cf. A064988 (apply prime to p), A321874 (apply prime to both p & e).

a:= n-> mul(i[1]^ithprime(i[2]), i=ifactors(n)[2]):
seq(a(n), n=1..55);  # Alois P. Heinz, Jan 20 2021

a[n_] := Times @@ (#[[1]]^Prime[#[[2]]] & /@ FactorInteger[n]); Table[a[n], {n, 55}]

a(n) = my(f=factor(n)); prod(k=1, #f~, f[k,1]^prime(f[k,2])); \\ Michel Marcus, May 09 2018

apply( A304203(n)=factorback((n=factor(n))[,1],apply(prime,n[,2])), [1..50]) \\ M. F. Hasler, Nov 20 2018

a(prime(i)^k) = prime(i)^prime(k).
a(A000040(k)) = A001248(k).
a(A001248(k)) = A030078(k).
a(A030078(k)) = A050997(k).
a(A002110(k)) = A061742(k).
Multiplicative with a(p^e) = p^prime(e). - M. F. Hasler, Nov 20 2018
Sum_{n>=1} 1/a(n) = Product_{p prime} (1 + Sum_{k>=1} 1/p^prime(k)) = 1.80728269690724154161... . - Amiram Eldar, Jan 20 2024

A362841 Numbers with at least one 5 in their prime signature.

Original entry on oeis.org

32, 96, 160, 224, 243, 288, 352, 416, 480, 486, 544, 608, 672, 736, 800, 864, 928, 972, 992, 1056, 1120, 1184, 1215, 1248, 1312, 1376, 1440, 1504, 1568, 1632, 1696, 1701, 1760, 1824, 1888, 1944, 1952, 2016, 2080, 2144, 2208, 2272, 2336, 2400, 2430, 2464, 2528, 2592, 2656, 2673, 2720, 2784, 2848, 2912, 2976

Offset: 1

R. J. Mathar, May 05 2023

nonn

Contains all odd multiples of 2^5: Each second term of A174312 is in this sequence.

The asymptotic density of this sequence is 1 - Product_{p prime} (1 - 1/p^5 + 1/p^6) = 0.01863624892... . - Amiram Eldar, May 05 2023

			Contains 2^5, 2^5*3, 2^5*5, 2^5*7, 3^5, 2^5*3^2, 2^5*11, 2^5*13, 2^5*3*5, 2*3^5, etc.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A038109 (at least one 2), A176297 (at least one 3), A050997 (subsequence), A178740 (subsequence), A179646 (subsequence), A179667 (subsequence), A179671 (subsequence), A174312.

Select[Range[3000], MemberQ[FactorInteger[#][[;;, 2]], 5] &] (* Amiram Eldar, May 05 2023 *)

A376171 Powerful numbers whose prime factorization has an odd maximum exponent.

Original entry on oeis.org

8, 27, 32, 72, 108, 125, 128, 200, 216, 243, 288, 343, 392, 500, 512, 675, 800, 864, 968, 972, 1000, 1125, 1152, 1323, 1331, 1352, 1372, 1568, 1800, 1944, 2048, 2187, 2197, 2312, 2592, 2700, 2744, 2888, 3087, 3125, 3200, 3267, 3375, 3456, 3528, 3872, 3888, 4000

Offset: 1

Amiram Eldar, Sep 13 2024

Subsequence of A102834 and first differs from it at n = 14: A102834(14) = 432 = 2^4 * 3^3 is not a term of this sequence.
Powerful numbers k such that A051903(k) is odd.
Equivalently, numbers whose prime factorization exponents are all larger than 1 and their maximum is odd. The maximum exponent in the prime factorization of 1 is considered to be A051903(1) = 0, and therefore 1 is not a term of this sequence.
The numbers of terms that do not exceed the 10^k-powerful number (A376092(k)), for k = 1, 2, ..., are 3, 40, 416, 4255, 42829, 429393, 4299797, 43022803, ... . Apparently, the asymptotic density of this sequence within the powerful numbers (A001694) exists and approximately equals 0.43.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for sequences related to powerful numbers.

Complement of A376170 within A001694.
Intersection of A001694 and A376142.
Subsequence of A102834.
Subsequences: A030078, A050997, A079395, A092759, A138031, A179665, A335988 \ {1}.
Cf. A051903, A082695, A376092.

seq[lim_] := Select[Union@ Flatten@ Table[i^2 * j^3, {j, 1, Surd[lim, 3]}, {i, 1, Sqrt[lim/j^3]}], # > 1 && OddQ[Max[FactorInteger[#][[;; , 2]]]] &]; seq[10^4]

is(k) = {my(f = factor(k), e = f[,2]); #e && ispowerful(f) && vecmax(e) % 2;}

Sum_{n>=1} 1/a(n) = zeta(2)*zeta(3)/zeta(6) - Sum_{k>=2} (-1)^k * s(k) = 0.29116340833243888282..., where s(k) = Product_{p prime} (1 + Sum_{i=2..k} 1/p^i).

A065985 Numbers k such that d(k) / 2 is prime, where d(k) = number of divisors of k.

Original entry on oeis.org

6, 8, 10, 12, 14, 15, 18, 20, 21, 22, 26, 27, 28, 32, 33, 34, 35, 38, 39, 44, 45, 46, 48, 50, 51, 52, 55, 57, 58, 62, 63, 65, 68, 69, 74, 75, 76, 77, 80, 82, 85, 86, 87, 91, 92, 93, 94, 95, 98, 99, 106, 111, 112, 115, 116, 117, 118, 119, 122, 123, 124, 125, 129, 133, 134

Offset: 1

Joseph L. Pe, Dec 10 2001

nonn

Numbers whose sorted prime signature (A118914) is either of the form {2*p-1} or {1, p-1}, where p is a prime. Equivalently, disjoint union of numbers of the form q^(2*p-1) where p and q are primes, and numbers of the form r * q^(p-1), where p, q and r are primes and r != q. - Amiram Eldar, Sep 09 2024

Harry J. Smith, Table of n, a(n) for n = 1..1000

Cf. A000005, A118914.
Numbers with exactly 2*p divisors: A030513 (p=2), A030515 (p=3), A030628 \ {1} (p=5), A030632 (p=7), A137485 (p=11), A137489 (p=13), A175744 (p=17), A175747 (p=19).
Subsequences: A006881, A030078, A050997, A054753, A095990, A096156, A138031, A178739, A179665, A189987.

Select[Range[1, 1000], PrimeQ[DivisorSigma[0, # ] / 2] == True &]

n=0; for (m=1, 10^9, f=numdiv(m)/2; if (frac(f)==0 && isprime(f), write("b065985.txt", n++, " ", m); if (n==1000, return))) \\ Harry J. Smith, Nov 05 2009

is(n)=n=numdiv(n)/2; denominator(n)==1 && isprime(n) \\ Charles R Greathouse IV, Oct 15 2015

A086874 Seventh power of odd primes.

Original entry on oeis.org

2187, 78125, 823543, 19487171, 62748517, 410338673, 893871739, 3404825447, 17249876309, 27512614111, 94931877133, 194754273881, 271818611107, 506623120463, 1174711139837, 2488651484819, 3142742836021, 6060711605323

Offset: 1

Douglas Winston (douglas.winston(AT)srupc.com), Sep 16 2003

Cf. A000040, A001248, A030078, A030514, A050997, A030516, A000244, A000351, A000420, A001020, A001022, A001026, A001029, A009967, A009973, A009975, A009981, A009985, A009987, A009991.

Prime[Range[2,20]]^7 (* Harvey P. Dale, Sep 16 2013 *)

a(n) = prime(n+1)^7 \\ Michel Marcus, Jul 17 2013

A118092 Odd primes raised to odd prime powers.

Original entry on oeis.org

27, 125, 243, 343, 1331, 2187, 2197, 3125, 4913, 6859, 12167, 16807, 24389, 29791, 50653, 68921, 78125, 79507, 103823, 148877, 161051, 177147, 205379, 226981, 300763, 357911, 371293, 389017, 493039, 571787, 704969, 823543, 912673, 1030301

Offset: 1

Jonathan Vos Post, May 11 2006

Subset of A053810 Prime powers of prime numbers. Subset of A000961 Prime powers. Subsets include A030078 Cubes of primes, A050997 Fifth powers of primes.

Cf. A000040, A000961, A030078, A050997, A051006, A053810, A065091.

With[{prs=Prime[Range[2,30]]},Take[Union[First[#]^Last[#]&/@ Tuples[prs,2]],40]] (* Harvey P. Dale, Dec 23 2011 *)

from sympy import primepi, integer_nthroot, primerange
def A118092(n):
    def f(x): return int(n+x-sum(primepi(integer_nthroot(x, p)[0])-1 for p in primerange(3,x.bit_length())))
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    return bisection(f,n,n) # Chai Wah Wu, Sep 12 2024

{p^q where p is in A065091 and q is in A065091}.

Sum_{n>=1} 1/a(n) = Sum_{p odd prime} P(p) - A051006 + 1/4 = 0.054745292329555814476..., where P(s) is the prime zeta function. - Amiram Eldar, Sep 13 2024

Extended by Ray Chandler, Oct 28 2008

A118097 Primes of form 2 + odd prime to odd prime power.

Original entry on oeis.org

29, 127, 24391, 161053, 357913, 571789, 1442899, 5177719, 18191449, 30080233, 73560061, 80062993, 118370773, 127263529, 131872231, 318611989, 344472103, 440711083, 461889919, 590589721, 756058033, 865523179, 1095912793

Offset: 1

Jonathan Vos Post, May 11 2006

A prime p for which p + 2 is prime is in A001359 Lesser of twin primes. This sequence is a generalization of that, but with prime to prime power substituting for prime (and excluding 2 from base and exponent).

			a(1) = 29 = 3^3 + 2.
a(2) = 127 = 5^3 + 2.
a(3) = 24391 = 29^3 + 2.
a(4) = 161053 = 11^5 + 2.
a(5) = 357913 = 71^3 + 2.
a(6) = 571789 = 83^3 + 2.
1174711139839 is in this sequence because 1174711139839 = 53^7 + 2 is prime.

Cf. A000040, A000961, A001359, A030078, A050997, A053810, A065091.

{p^q + 2 where p is in A065091 and q is in A065091}.

Extended by Ray Chandler, Oct 28 2008

cp's OEIS Frontend

A369969 Numbers that are not multiples of 5, but their arithmetic derivative is.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

PARI

A382292 Numbers k such that A382290(k) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A275345 Characteristic polynomials of a square matrix based on A051731 where A051731(1,N)=1 and A051731(N,N)=0 and where N=size of matrix, analogous to the Redheffer matrix.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A304203 If n = Product (p_j^k_j) then a(n) = Product (p_j^prime(k_j)).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A362841 Numbers with at least one 5 in their prime signature.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A376171 Powerful numbers whose prime factorization has an odd maximum exponent.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A065985 Numbers k such that d(k) / 2 is prime, where d(k) = number of divisors of k.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

A086874 Seventh power of odd primes.

Views

Author

Keywords

Crossrefs