A304481 -id:A304481 - cp's OEIS frontend

A304491 Last or deepest exponent in the power-tower for n.

1, 2, 3, 2, 5, 6, 7, 3, 2, 10, 11, 12, 13, 14, 15, 2, 17, 18, 19, 20, 21, 22, 23, 24, 2, 26, 3, 28, 29, 30, 31, 5, 33, 34, 35, 2, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 2, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 6, 65, 66, 67, 68, 69

Offset: 1

Gus Wiseman, May 13 2018

nonn

Let {c(i)} = A007916 denote the sequence of numbers > 1 which are not perfect powers. Every positive integer n has a unique representation as a tower n = c(x_1)^c(x_2)^c(x_3)^...^c(x_k), where the exponents are nested from the right. Then a(n) = c(x_k).

			We have 16 = 2^2^2, so a(16) = 2.
We have 64 = 2^6, so a(64) = 6.
We have 81 = 3^2^2, so a(81) = 2.
We have 256 = 2^2^3, so a(256) = 3.

Andrew Howroyd, Table of n, a(n) for n = 1..10000

Cf. A052409, A052410, A007916, A089723, A164337, A277562, A277564, A278028, A288636, A289023, A294336, A294337, A304481, A304492, A304495.

a[n_]:=If[n==1,1,With[{g=GCD@@FactorInteger[n][[All,2]]},If[g==1,n,a[g]]]];
Array[a,100]

a(n)={my(t=n); while(t, n=t; t=ispower(t)); n} \\ Andrew Howroyd, Aug 26 2018

a(n) = A007916(A278028(n, A288636(n))).

A304495 Decapitate the power-tower for n, i.e., remove the last (deepest) exponent.

Original entry on oeis.org

0, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1

Offset: 1

Gus Wiseman, May 13 2018

nonn

a(1) = 0 by convention.

			We have 64 = 2^6, so a(64) = 2.
We have 216 = 6^3, so a(216) = 6.
We have 256 = 2^2^3, so a(256) = 2^2 = 4.

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A052409, A052410, A001597, A007916, A089723, A164337, A277562, A277564, A278028, A288636, A289023, A294336, A294337, A304481, A304491, A304492.

tow[n_]:=If[n==1,{},With[{g=GCD@@FactorInteger[n][[All,2]]},If[g===1,{n},Prepend[tow[g],n^(1/g)]]]];
Table[If[n==1,0,Power@@Most[tow[n]]],{n,100}]

A304495(n) = if(1==n,0,my(e, r, tow = List([])); while((e = ispower(n,,&r)) > 1, listput(tow, r); n = e;); n = 1; while(length(tow)>0, e = tow[#tow]; listpop(tow); n = e^n;); (n)); \\ Antti Karttunen, Jul 23 2018

a(m) <> 1 if m is a perfect power (A001597). - Michel Marcus, Jul 23 2018

Name edited and more terms from Antti Karttunen, Jul 23 2018

A304492 Position in the sequence of numbers that are not perfect powers (A007916) of the last or deepest exponent in the power-tower for n.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, May 13 2018

nonn

Cf. A052409, A052410, A007916, A089723, A164337, A277562, A277564, A278028, A288636, A289023, A294336, A294337, A304481, A304491, A304495.

nn=100;
a[n_]:=If[n==1,1,With[{g=GCD@@FactorInteger[n][[All,2]]},If[g==1,n,a[g]]]];
rads=Union[Array[a,nn]];
Table[a[n],{n,nn}]/.Table[rads[[i]]->i,{i,Length[rads]}]

a(n) = A278028(n, A288636(n)).

cp's OEIS Frontend

A304491 Last or deepest exponent in the power-tower for n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A304495 Decapitate the power-tower for n, i.e., remove the last (deepest) exponent.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A304492 Position in the sequence of numbers that are not perfect powers (A007916) of the last or deepest exponent in the power-tower for n.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

Formula