A196228 -id:A196228 - cp's OEIS frontend

A282947 Number of ways of writing n as a sum of a perfect power and a squarefree semiprime.

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

Offset: 0

Ilya Gutkovskiy, Feb 25 2017

nonn

Conjecture: a(n) > 0 for all n > 108.
From Robert G. Wilson v, Feb 25 2017: (Start)
Conjecture: a(n) > 1 for all n > 604,
Conjecture: a(n) > 2 for all n > 1008, etc.
First occurrence of k: 0, 7, 14, 22, 30, 47, 66, 42, 127, 138, 150, 222, 251, 303, 210, 430, 330, 462, 670, 770, 983, 878, 1038, 1142, 1355, 1482, ... (End)

			a(22) = 3 because we have [21, 1], [16, 6] and [14, 8].

Robert G. Wilson v, Table of n, a(n) for n = 0..1000
Ilya Gutkovskiy, Extended graphical example
Eric Weisstein's World of Mathematics, Perfect Powers
Eric Weisstein's World of Mathematics, Semiprime
Eric Weisstein's World of Mathematics, Squarefree

Cf. A001597, A006881, A196228, A282192, A282290.

nmax = 120; CoefficientList[Series[(x + Sum[Boole[GCD @@ FactorInteger[k][[All, 2]] > 1] x^k, {k, 2, nmax}]) (Sum[MoebiusMu[k]^2 Floor[2/PrimeOmega[k]] Floor[PrimeOmega[k]/2] x^k, {k, 2, nmax}]), {x, 0, nmax}], x]

G.f.: (Sum_{k>=1} x^A001597(k))*(Sum_{k>=1} x^A006881(k)).

A253238 Number of ways to write n as a sum of a perfect power (>1) and a prime.

Original entry on oeis.org

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

Offset: 1

Eric Chen, May 17 2015

In this sequence, "perfect power" does not include 0 or 1, "prime" does not include 1. Both "perfect power" and "prime" must be positive.
In the past, I conjectured that a(n) > 0 for all n>24, but this is not true. My PARI program found that a(1549) = 0.
I also asked which a(n) are 1. For example, 331 is a de Polignac number (A006285), so it cannot be written as 2^n+p with p prime, and 331-6^n must divisible by 5, 331-10^n must divisible by 3, ..., 331-18^2 = 331-324 = 7 is prime (and it is the only prime of the form 331-m^n, with m, n natural numbers, m>1, n>1), so a(331) = 1. Similarly, a(3319) = 1. Conjecture: a(n) > 1 for all n > 3319.
This conjecture is not true: a(1771561) = 0. (See A119748)
Another conjecture: For every number m>=0, there is a number k such that a(n)>=m for all n>=k.
Another conjecture: Except for k=2, first occurrence of k must be earlier then first occurrence of k+1.
For n such that a(n) = 0, see A119748.
For n such that a(n) = 1, see the following a-file of this sequence.

Eric Chen and Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 (first 3000 terms from Chen)
Eric Chen, The unique way to write n as a sum of a perfect power (>1) and a prime for those n such a(n)=1

Cf. A196228, A119748, A109925, A118954, A064272, A064233, A002471, A014090.

nn = 128; pwrs = Flatten[Table[Range[2, Floor[nn^(1/ex)]]^ex, {ex, 2, Floor[Log[2, nn]]}]]; pp = Prime[Range[PrimePi[nn]]]; t = Table[0, {nn}]; Do[ t[[i[[1]]]] = i[[2]], {i, Tally[Sort[Select[Flatten[Outer[Plus, pwrs, pp]], # <= nn &]]]}]; t

a(n) = sum(k=1, n-1, ispower(k) && isprime(n-k))

a(n)=sum(e=2,log(n)\log(2),sum(b=2,sqrtnint(n,e),isprime(n-b^e)&&!ispower(b))) \\ Charles R Greathouse IV, May 28 2015

A365294 a(n) is the least positive integer that can be expressed as the sum of a prime number and a perfect power in exactly n ways.

Original entry on oeis.org

1, 3, 6, 11, 27, 38, 105, 128, 248, 227, 398, 572, 692, 668, 902, 908, 1172, 1448, 2288, 1748, 1592, 2483, 3167, 3932, 3902, 3737, 4457, 3632, 5843, 6443, 6233, 8048, 6992, 5297, 8678, 6368, 8888, 10688, 9908, 8153, 8777, 13163, 14222, 16463, 14528, 14948

Offset: 0

Ilya Gutkovskiy, Aug 31 2023

nonn

			For n = 3: 11 = 2 + 3^2 = 3 + 2^3 = 7 + 2^2.

Cf. A000040, A001597, A119748, A196228.

cp's OEIS Frontend

A282947 Number of ways of writing n as a sum of a perfect power and a squarefree semiprime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A253238 Number of ways to write n as a sum of a perfect power (>1) and a prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

A365294 a(n) is the least positive integer that can be expressed as the sum of a prime number and a perfect power in exactly n ways.

Views

Author

Keywords

Examples

Crossrefs