login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A290103
a(n) = LCM of the prime indices in prime factorization of n, a(1) = 1.
81
1, 1, 2, 1, 3, 2, 4, 1, 2, 3, 5, 2, 6, 4, 6, 1, 7, 2, 8, 3, 4, 5, 9, 2, 3, 6, 2, 4, 10, 6, 11, 1, 10, 7, 12, 2, 12, 8, 6, 3, 13, 4, 14, 5, 6, 9, 15, 2, 4, 3, 14, 6, 16, 2, 15, 4, 8, 10, 17, 6, 18, 11, 4, 1, 6, 10, 19, 7, 18, 12, 20, 2, 21, 12, 6, 8, 20, 6, 22, 3, 2, 13, 23, 4, 21, 14, 10, 5, 24, 6, 12, 9, 22, 15, 24, 2, 25, 4, 10, 3, 26, 14, 27, 6, 12
OFFSET
1,3
FORMULA
a(1) = 1; for n > 1, a(n) = lcm(A055396(n), a(A028234(n)).
Other identities. For all n >= 1:
a(A007947(n)) = a(n).
a(A181819(n)) = A072411(n).
EXAMPLE
Here primepi (A000720) gives the index of its prime argument:
n = 14 = 2 * 7, thus a(14) = lcm(primepi(2), primepi(7)) = lcm(1,4) = 4.
n = 21 = 3 * 7, thus a(21) = lcm(primepi(3), primepi(7)) = lcm(2,4) = 4.
MATHEMATICA
Table[Apply[LCM, PrimePi[FactorInteger[n][[All, 1]] ]] + Boole[n == 1], {n, 105}] (* Michael De Vlieger, Aug 14 2017 *)
PROG
(Scheme) (define (A290103 n) (if (= 1 n) n (lcm (A055396 n) (A290103 (A028234 n))))) ;; Antti Karttunen, Aug 13 2017
(PARI) a(n)=if(n>1, lcm(apply(primepi, factor(n)[, 1])), 1) \\ Charles R Greathouse IV, Nov 11 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 13 2017
STATUS
approved