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-3 of 3 results.

A327538 Number of steps to reach a fixed point starting with n and repeatedly taking the quotient by the maximum divisor that is 1, prime, or whose prime indices are relatively prime (A327535, A327537).

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 2
Offset: 1

Views

Author

Gus Wiseman, Sep 17 2019

Keywords

Comments

The first index m such that a(m) > 1 but m is not in A322336 is m = 2335.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers that are 1, prime, or whose prime indices are relatively prime are A327534. The number of divisors of n satisfying the same conditions is A327536(n).

Examples

			We have 441 -> 63 -> 9 -> 3 -> 1, so a(441) = 4.

Links

Crossrefs

See link for additional cross-references.
Cf. A000005, A001222, A006530, A056239, A112798, A289509, A327407.

Programs

  • Mathematica
    Table[Length[FixedPointList[#/Max[Select[Divisors[#],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&]]&,n]]-2,{n,100}]

Formula

a(1) = 0; if n is prime or has relatively prime prime indices, then a(n) = 1; otherwise a(n) = Omega(n) = A001222(n).

A327536 Number of divisors of n that are 1, prime, or whose prime indices are relatively prime.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 4, 2, 4, 2, 6, 2, 4, 4, 5, 2, 5, 2, 6, 3, 4, 2, 8, 2, 4, 2, 6, 2, 8, 2, 6, 4, 4, 4, 8, 2, 4, 3, 8, 2, 7, 2, 6, 5, 4, 2, 10, 2, 5, 4, 6, 2, 6, 4, 8, 3, 4, 2, 12, 2, 4, 3, 7, 3, 8, 2, 6, 4, 8, 2, 11, 2, 4, 5, 6, 4, 7, 2, 10, 2, 4, 2, 11, 4
Offset: 1

Views

Author

Gus Wiseman, Sep 17 2019

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers that are 1, prime, or whose prime indices are relatively prime are A327534. The maximum divisor of n satisfying the same conditions is A327535(n).

Examples

			The divisors of 63 that are 1, prime, or whose prime indices are relatively prime are {1, 3, 7}, so a(63) = 3.

Links

Crossrefs

See link for additional cross-references.
Cf. A000005, A056239, A112798, A281116, A289509, A327407.

Programs

  • Mathematica
    Table[Length[Select[Divisors[n],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&]],{n,100}]

A327537 Quotient of n over the maximum divisor of n that is 1, prime, or whose prime indices are relatively prime.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 9, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 1, 3
Offset: 1

Views

Author

Gus Wiseman, Sep 17 2019

Keywords

Comments

All terms are odd.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798. Numbers that are 1, prime, or whose prime indices are relatively prime are A327534. The maximum divisor of n satisfying the same conditions is A327535(n).

Examples

			The divisors of 63 that are 1, prime, or whose prime indices are relatively prime are {1, 3, 7}, so a(63) = 63/7 = 9.

Links

Crossrefs

See link for additional cross-references.
Cf. A000005, A006530, A032742, A056239, A112798, A289509, A327407.

Programs

  • Mathematica
    Table[n/Max[Select[Divisors[n],#==1||PrimeQ[#]||GCD@@PrimePi/@First/@FactorInteger[#]==1&]],{n,100}]

Formula

If n is in A327534, then a(n) = 1; otherwise a(n) = n/A006530(n) = A032742(n).
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.