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.

A101040 If n has one or two prime-factors then 1 else 0.

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Nov 28 2004

Keywords

Comments

a(A033942(n))=0; for n>1: a(A037143(n))=1;
a(A000040(n))=1; a(A001358(n))=1;
A101041(n) = Sum(a(k): 1<=k<=n) + 1.
Primes counted with multiplicity. - Harvey P. Dale, Feb 16 2024

Crossrefs

Characteristic function of A037143 (without its initial term 1).

Programs

Formula

a(n) = A010051(n)+A064911(n) = 0^floor(A001222(n)/3)-0^(n-1).
a(1) = 0; for n > 1, a(n) = A063524(A032742(A032742(n))). - Antti Karttunen, Nov 23 2017