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.

A285329 a(n) = A013928(A007947(n)).

Original entry on oeis.org

0, 1, 2, 1, 3, 4, 5, 1, 2, 6, 7, 4, 8, 9, 10, 1, 11, 4, 12, 6, 13, 14, 15, 4, 3, 16, 2, 9, 17, 18, 19, 1, 20, 21, 22, 4, 23, 24, 25, 6, 26, 27, 28, 14, 10, 29, 30, 4, 5, 6, 31, 16, 32, 4, 33, 9, 34, 35, 36, 18, 37, 38, 13, 1, 39, 40, 41, 21, 42, 43, 44, 4, 45, 46, 10, 24, 47, 48, 49, 6, 2, 50, 51, 27, 52, 53, 54, 14, 55, 18, 56, 29, 57, 58, 59, 4, 60, 9, 20, 6
Offset: 1

Views

Author

Antti Karttunen, Apr 17 2017

Keywords

Comments

For n > 1, a(n) gives the (one-based) index of the column where n is located in array A284311, or respectively, index of the row where n is in A284457. A008479 gives the other index.

Crossrefs

Cf. A008479 (the other index).
Cf. array A284311 (A284457).

Programs

  • Python
    from operator import mul
    from sympy import primefactors
    from sympy.ntheory.factor_ import core
    from functools import reduce
    def a007947(n): return 1 if n<2 else reduce(mul, primefactors(n))
    def a013928(n): return sum(1 for i in range(1, n) if core(i) == i)
    print([a013928(a007947(n)) for n in range(1, 101)]) # Indranil Ghosh, Apr 18 2017
    
  • Python
    from math import prod, isqrt
    from sympy import primefactors, mobius
    def A285329(n):
        m=prod(primefactors(n))-1
        return sum(mobius(k)*(m//k**2) for k in range(1,isqrt(m)+1)) # Chai Wah Wu, May 12 2024

Formula

a(n) = A013928(A007947(n)).
Other identities. For all n >= 0:
If A008683(n) <> 0 [when n is squarefree, A005117], a(n) = A013928(n), otherwise a(n) = a(A285328(n)).
a(A019565(n)) = A064273(n).