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.

A363921 A363920 evaluated over the nonprime numbers.

Original entry on oeis.org

1, 1, 16, 1296, 512, 81, 10000, 2985984, 38416, 50625, 65536, 34012224, 64000000, 194481, 234256, 110075314176, 625, 456976, 19683, 481890304, 19683000000000, 33554432, 1185921, 1336336, 1500625, 2821109907456, 2085136, 2313441, 6553600000000, 406671383849472
Offset: 0

Views

Author

Peter Luschny, Jul 16 2023

Keywords

Crossrefs

Programs

  • Maple
    seq(A363920(n), n in remove(isprime, [$0..42]));
  • Mathematica
    {1}~Join~Map[#^(PrimeOmega[#]*PrimeNu[#]) &, Select[Range[42], Not@*PrimeQ]] (* Michael De Vlieger, Jul 27 2023 *)

A364360 a(n) = dpf(n) ^ tpf(n), where dpf(n) is the number of distinct prime factors of n if n >= 2 and otherwise = 0; tpf(n) is the number of all prime factors of n if n >= 2 and otherwise = 0.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 4, 1, 8, 1, 4, 4, 1, 1, 8, 1, 8, 4, 4, 1, 16, 1, 4, 1, 8, 1, 27, 1, 1, 4, 4, 4, 16, 1, 4, 4, 16, 1, 27, 1, 8, 8, 4, 1, 32, 1, 8, 4, 8, 1, 16, 4, 16, 4, 4, 1, 81, 1, 4, 8, 1, 4, 27, 1, 8, 4, 27, 1, 32, 1, 4, 8, 8, 4, 27, 1, 32, 1
Offset: 0

Views

Author

Peter Luschny, Jul 20 2023

Keywords

Crossrefs

Programs

  • Maple
    with(numtheory):
    dpf := n -> ifelse(n = 0, 0, nops(factorset(n))): # dpf = [0] U [A001221].
    tpf := n -> ifelse(n = 0, 0, bigomega(n)):        # tpf = [0] U [A001222].
    A364360 := n -> dpf(n) ^ tpf(n):
    seq(A364360(n), n = 0..81);

Formula

For n >= 2:
a(n) = 1 => a(n) in A246655, prime powers.
a(n) > 1 => a(n) in A024619, complement of A246655.
Showing 1-2 of 2 results.