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.

A284261 a(n) = A284258(n) - A284258(A003961(n)).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1
Offset: 1

Views

Author

Antti Karttunen, Mar 24 2017

Keywords

Comments

The first 2 occurs at n = 429 = 3*11*13. A003961(429) = 1105 = 5*13*17.
The first 3 occurs at n = 7293 = 3*11*13*17. A003961(7293) = 20995 = 5*13*17*19.

Crossrefs

Programs

  • Mathematica
    Table[If[n == 1, 0, Subtract @@ Map[Count[#, d_ /; d > First[#]^2] &@ FactorInteger[#][[All, 1]] &, {n, Times @@ Map[#1^#2 & @@ # &, FactorInteger[n] /. {p_, e_} /; e > 0 :> {Prime[PrimePi@ p + 1], e}] - Boole[n == 1]}]], {n, 120}] (* Michael De Vlieger, Mar 24 2017 *)
  • Scheme
    (define (A284261 n) (- (A284258 n) (A284258 (A003961 n))))

Formula

a(n) = A284258(n) - A284258(A003961(n)).

Extensions

Secondary offset corrected by Antti Karttunen, Dec 15 2017