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.

A358817 Numbers k such that A046660(k) = A046660(k+1).

Original entry on oeis.org

1, 2, 5, 6, 10, 13, 14, 21, 22, 29, 30, 33, 34, 37, 38, 41, 42, 44, 46, 49, 57, 58, 61, 65, 66, 69, 70, 73, 75, 77, 78, 80, 82, 85, 86, 93, 94, 98, 101, 102, 105, 106, 109, 110, 113, 114, 116, 118, 122, 129, 130, 133, 135, 137, 138, 141, 142, 145, 147, 154, 157
Offset: 1

Views

Author

Amiram Eldar, Dec 02 2022

Keywords

Comments

First differs from its subsequence A007674 at n=18.
The numbers of terms not exceeding 10^k, for k = 1, 2, ..., are 5, 38, 369, 3655, 36477, 364482, 3644923, 36449447, 364494215, 3644931537, ... . Apparently, the asymptotic density of this sequence exists and equals 0.36449... .

Crossrefs

Cf. A046660.
Subsequences: A007674, A052213, A085651, A358818.
Similar sequences: A002961, A005237, A006049, A045920.

Programs

  • Mathematica
    seq[kmax_] := Module[{s = {}, e1 = 0, e2}, Do[e2 = PrimeOmega[k] - PrimeNu[k]; If[e1 == e2, AppendTo[s, k - 1]]; e1 = e2, {k, 2, kmax}]; s]; seq[160]
  • PARI
    e(n) = {my(f = factor(n)); bigomega(f) - omega(f)};
    lista(nmax) = {my(e1 = e(1), e2); for(n=2, nmax, e2=e(n); if(e1 == e2, print1(n-1,", ")); e1 = e2);}