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.

A143731 Characteristic function of numbers with at least two distinct prime factors (A024619).

Original entry on oeis.org

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

Views

Author

Reikku Kulon, Aug 30 2008

Keywords

Comments

a(n) = 1 iff n is divisible by at least two distinct primes; otherwise 0.

Crossrefs

Programs

Formula

a(n) = abs(A079872(n)) = A057427(A079275(n)).
For n>1: a(n) = 1 - floor(1/A001221(n)). - Enrique Pérez Herrero, Aug 13 2012

A079869 a(1)=1 and for n>1: round(n^(1/Omega(n)))^Omega(n), where Omega(n) is the total number of prime factors of n (A001222).

Original entry on oeis.org

1, 2, 3, 4, 5, 4, 7, 8, 9, 9, 11, 8, 13, 16, 16, 16, 17, 27, 19, 27, 25, 25, 23, 16, 25, 25, 27, 27, 29, 27, 31, 32, 36, 36, 36, 16, 37, 36, 36, 81, 41, 27, 43, 64, 64, 49, 47, 32, 49, 64, 49, 64, 53, 81, 49, 81, 64, 64, 59, 81, 61, 64, 64, 64, 64, 64, 67, 64, 64, 64, 71, 32, 73
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 13 2003

Keywords

Comments

A079867(n)<=a(n)<=A079869(n); A020639(n)<=a(n)<=A006530(n);
a(m)=m=A079867(m)=A079871(m) iff m is a prime power (A000961).

Crossrefs

Programs

  • Mathematica
    ron[n_]:=Module[{c=PrimeOmega[n]},Round[n^(1/c)]^c]; Join[{1},Array[ ron,80,2]] (* Harvey P. Dale, Jun 17 2020 *)
Showing 1-2 of 2 results.