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-2 of 2 results.

A365887 Numbers k such that k and k+1 are both terms of A365886.

Original entry on oeis.org

80, 567, 728, 1215, 1376, 1863, 2024, 2511, 2672, 3159, 3320, 3807, 3968, 4455, 4616, 5103, 5264, 5751, 5912, 6399, 6560, 7047, 7208, 7695, 7856, 8343, 8504, 8991, 9152, 9639, 9800, 10287, 10448, 10935, 11096, 11583, 11744, 12231, 12392, 12879, 13040, 13527, 13688
Offset: 1

Views

Author

Amiram Eldar, Sep 22 2023

Keywords

Comments

The numbers of terms not exceeding 10^k, for k = 2, 3, ..., are 1, 3, 31, 310, 3097, 30971, 309711, 3097110, 30971095, 309710953, ... . Apparently, the asymptotic density of this sequence exists and equals 0.003097109... .

Examples

			80 = 2^4 * 5 is a term since its least prime factor, 2, is smaller than its exponent, 4, and the least prime factor of 81 = 3^4, 3, is also smaller than its exponent, 4.
		

Crossrefs

Subsequence of A365886.
A365888 is a subsequence.

Programs

  • Mathematica
    q[n_] := Less @@ FactorInteger[n][[1]]; consec[kmax_] := Module[{m = 1, c = Table[False, {2}], s = {}}, Do[c = Join[Rest[c], {q[k]}]; If[And @@ c, AppendTo[s, k - 1]], {k, 1, kmax}]; s]; consec[14000]
  • PARI
    is(n) = {my(f = factor(n)); n > 1 && f[1, 1] < f[1, 2];}
    lista(kmax) = {my(q1 = 0, q2); for(k = 2, kmax, q2 = is(k); if(q1 && q2, print1(k-1, ", ")); q1 = q2);}

A365888 Starts of run of 3 consecutive integers that are terms of A365886.

Original entry on oeis.org

3484375, 6640623, 13609375, 16765623, 23734375, 26890623, 33859375, 37015623, 43984375, 47140623, 54109375, 57265623, 64234375, 67390623, 74359375, 77515623, 84484375, 87640623, 94609375, 97765623, 104734375, 107890623, 114859375, 118015623, 124984375, 128140623
Offset: 1

Views

Author

Amiram Eldar, Sep 22 2023

Keywords

Comments

Numbers k such that k, k+1 and k+2 are all terms of A365886.
Numbers of the form 4*k+2 are not terms of A365886. Therefore there are no runs of 4 or more consecutive integers. Since the middle integer in each triple is even it must be and divisible by 8, so all the terms of this sequence are of the form 8*k+7.
The numbers of terms not exceeding 10^k, for k = 7, 8, ..., are 2, 20, 198, 1979, 19796, ... . Apparently, the asymptotic density of this sequence exists and equals 1.979...*10^(-7).

Examples

			3484375 = 5^6 * 223 is a term since its least prime factor, 5, is smaller than its exponent, 6, the least prime factor of 3484376 = 2^3 * 7 * 43 * 1447, 2, is smaller than its exponent, 3, and the least prime factor of 3484377 = 3^5 * 13 * 1103, 3, is also smaller than its exponent, 5.
		

Crossrefs

Subsequence of A004771, A365886 and A365887.

Programs

  • Mathematica
    q[n_] := Less @@ FactorInteger[n][[1]]; Select[8 * Range[10^6] + 7, AllTrue[# + {0, 1, 2}, q] &]
  • PARI
    is(n) = {my(f = factor(n)); n > 1 && f[1, 1] < f[1, 2];}
    lista(kmax) = forstep(k = 7, kmax, 8, if(is(k) && is(k+1) && is(k+2), print1(k, ", ")));
Showing 1-2 of 2 results.