A377430 -id:A377430 - cp's OEIS frontend

A379306 Number of squarefree prime indices of n.

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

Offset: 1

Gus Wiseman, Dec 25 2024

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 39 are {2,6}, so a(39) = 2.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.

Positions of first appearances are A000079.
Positions of zero are A379307, counted by A114374 (strict A256012).
Positions of one are A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A057627, A068361, A070321, A071403, A072284, A112925, A112929, A120327, A377430, A378086.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[prix[n],SquareFreeQ]],{n,100}]

Totally additive with a(prime(k)) = A008966(k).

A378374 Perfect powers p such that the interval from the previous perfect power to p contains a unique prime.

Original entry on oeis.org

128, 225, 256, 64009, 1295044

Offset: 1

Gus Wiseman, Dec 17 2024

Also numbers appearing exactly once in A378249.

			The consecutive perfect powers 125 and 128 have interval (125, 126, 127, 128) with unique prime 127, so 128 is in the sequence.

The previous prime is A178700.
For prime powers instead of perfect powers we have A345531, difference A377281.
Opposite singletons in A378035 (union A378253), restriction of A081676.
For squarefree numbers we have A378082, see A377430, A061398, A377431, A068360.
Singletons in A378249 (run-lengths A378251), restriction of A377468 to the primes.
If the same interval contains at least one prime we get A378250.
For next instead of previous perfect power we have A378355.
Swapping "prime" with "perfect power" gives A378364.
A000040 lists the primes, differences A001223.
A001597 lists the perfect powers, differences A053289.
A007916 lists the non perfect powers, differences A375706.
A069623 counts perfect powers <= n.
A076411 counts perfect powers < n.
A080769 counts primes between perfect powers.
Cf. A023055, A045542, A052410, A216765, A376560, A377287, A378356.

radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
y=Table[NestWhile[#+1&,Prime[n],radQ[#]&],{n,1000}];
Select[Union[y],Count[y,#]==1&]

We have a(n) < A178700(n) < A378355(n).

A378111 a(n) is the least prime p such that there are exactly n squarefree numbers strictly between p and the next prime, or -1 if there is no such p.

Original entry on oeis.org

2, 5, 13, 31, 89, 139, 113, 199, 211, 317, 1759, 1381, 1951, 887, 4523, 2179, 2477, 4831, 5351, 4297, 1327, 9973, 14107, 19333, 16141, 20809, 15683, 37907, 28229, 58831, 31907, 19609, 25471, 40289, 114493, 43331, 44293, 34061, 191353, 31397, 107377, 134513, 186481, 448451, 175141, 332317, 188029

Offset: 0

Robert Israel, Nov 29 2024

nonn

a(n) = A000040(k) where k is the least number such that A061398(k) = n.

			a(3) = 31 because there are 3 squarefree numbers between 31 and the next prime 37, namely 33, 34 and 35, and 31 is the least prime that works.

David A. Corneth, Table of n, a(n) for n = 0..253 (first 144 terms from Robert Israel)
David A. Corneth, PARI program

Cf. A000040, A005117, A061398, A377430.

V:= Array(0..100): count:= 0: q:= 2:
for k from 1 while count < 101 do
  p:= q; q:= nextprime(q);
  v:= nops(select(numtheory:-issqrfree,[$p+1 .. q-1]));
  if v <= 100 and V[v] = 0 then
    V[v]:= p; count:= count+1;
  fi
od:

cp's OEIS Frontend

A379306 Number of squarefree prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A378374 Perfect powers p such that the interval from the previous perfect power to p contains a unique prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A378111 a(n) is the least prime p such that there are exactly n squarefree numbers strictly between p and the next prime, or -1 if there is no such p.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple