cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

A104210 Positive integers divisible by at least 2 consecutive primes.

Original entry on oeis.org

6, 12, 15, 18, 24, 30, 35, 36, 42, 45, 48, 54, 60, 66, 70, 72, 75, 77, 78, 84, 90, 96, 102, 105, 108, 114, 120, 126, 132, 135, 138, 140, 143, 144, 150, 154, 156, 162, 165, 168, 174, 175, 180, 186, 192, 195, 198, 204, 210, 216, 221, 222, 225, 228, 231, 234, 240
Offset: 1

Views

Author

Leroy Quet, Mar 13 2005

Keywords

Comments

If a perfect square is in this sequence, then so is its square root (e.g., 144 and 12). - Alonso del Arte, May 07 2012
The numbers of terms not exceeding 10^k, for k=1,2,..., are 1, 22, 242, 2456, 24632, 246414, 2464272, 24643281, 246433426, ... Apparently, the asymptotic density of this sequence is 0.24643... - Amiram Eldar, Apr 10 2021

Examples

			35 is divisible by both 5 and 7, and 5 and 7 are consecutive primes.
77 is divisible by both 7 and 11, and 7 and 11 are consecutive primes.
110 is not in the sequence because, although it is divisible by 2, 5 and 11, it is not divisible by 3 or 7.
		

Crossrefs

Cf. A003961, A296210 (characteristic function), A319630 (complement), A379230 [= A252748(a(n))].
Positions of terms larger than 1 in A300820 and in A322361.
Subsequences: A006094, A349169 (conjectured, after its initial 1), A349176, A355527 (squarefree terms), A372566, A378884, A379232.

Programs

  • Maple
    N:= 1000: # for terms <= N
    R:= {}:
    p:= 2:
    do
      q:= p; p:= nextprime(p);
      if p*q > N then break fi;
      R:= R union {seq(i,i=p*q..N,p*q)}
    od:
    sort(convert(R,list)); # Robert Israel, Apr 13 2020
  • Mathematica
    fQ[n_] := Block[{lst = PrimePi /@ Flatten[ Table[ #[[1]], {1}] & /@ FactorInteger[n]]}, Count[ Drop[lst, 1] - Drop[lst, -1], 1] > 0]; Select[ Range[244], fQ[ # ] &] (* Robert G. Wilson v, Mar 16 2005 *)
  • PARI
    A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
    is_A104210(n) = (gcd(n,A003961(n))>1); \\ Antti Karttunen, Dec 24 2024

Formula

{k such that gcd(k, A003961(k)) > 1}. - Antti Karttunen, Dec 24 2024

Extensions

More terms from Robert G. Wilson v, Mar 16 2005

A379230 Difference A003961(k)-(2*k) computed for the natural numbers k for which gcd(k,A003961(k)) > 1, where A003961 is fully multiplicative with a(prime(i)) = prime(i+1).

Original entry on oeis.org

3, 21, 5, 39, 87, 45, 7, 153, 81, 85, 309, 267, 195, 63, 91, 531, 95, -11, 99, 327, 345, 1023, 81, 175, 909, 117, 705, 573, 321, 605, 159, 413, -65, 1737, 435, 121, 453, 1551, 125, 1149, 117, 189, 1215, 183, 3261, 205, 579, 447, 735, 2943, -119, 171, 775, 579, 253, 807, 2355, 357, 153, 1971, 155, 189, 1227, 2085
Offset: 1

Views

Author

Antti Karttunen, Dec 22 2024

Keywords

Comments

Each of the primes 3, 5, 7 occur here just once, while some other primes may occur multiple times, although very rare in general. See A379231 and A379232.

Crossrefs

Cf. A379231 (terms whose absolute value is a prime), A379232 (corresponding terms of A104210).
Cf. also A379233, A379235, A379237.

Formula

a(n) = A252748(A104210(n)).

A379231 Terms of A379230 whose absolute value is prime.

Original entry on oeis.org

3, 5, 7, -11, 19, 29, -37, -23, 31, -13, -11, 37, -311, 317, 593, 23, -11, -929, -53, 41, -59, -643, 29
Offset: 1

Views

Author

Antti Karttunen, Dec 23 2024

Keywords

Comments

Terms 3, 5, and 7 occur only once in this sequence, see A379233, A379235 and A379237 for the proofs.
Both abs(a(n)) and A151799(abs(a(n))) divide A379232(n).

Crossrefs

Subsequence of A379230.
Cf. A151799, A252748, A379232 (corresponding terms of A104210), A379233, A379235, A379237.

Formula

a(n) = A252748(A379232(n)).
Showing 1-3 of 3 results.