A164337 -id:A164337 - cp's OEIS frontend

A164336 a(1)=1. Thereafter, all terms are primes raised to the values of earlier terms of the sequence.

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227

Offset: 1

Leroy Quet, Aug 13 2009

nonn

These are the values of exponent towers consisting completely of primes coefficients. (For example, p^(q^(r^(s^..))), all variables being primes.) This sequence first differs from the terms of A096165, after the initial 1 in this sequence, when 18446744073709551616 = 2^64 occurs in A096165 but not in this sequence.

A064372(a(n)) = 1. [Reinhard Zumkeller, Aug 27 2011]

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Power Tower
Wikipedia, Tetration

Cf. A096165, A164337.

q:= n-> is(n=1 or (l-> nops(l)=1 and q(l[1, 2]))(ifactors(n)[2])):
select(q, [$1..350])[];  # Alois P. Heinz, Dec 30 2020

Block[{a = {1}}, Do[If[Length@ # == 1 && MemberQ[a, First@ #], AppendTo[a, i]] &[FactorInteger[i][[All, -1]]], {i, 2, 227}]; a] (* Michael De Vlieger, Aug 31 2017 *)

L=1000;S=[1];SS=[];while(#S!=#SS, SS=S;S=[];for(i=1,#SS,forprime(p=2,floor(L^(1/SS[i])),S=concat(S,p^SS[i])));S=eval(setunion(S,SS)));vecsort(S) \\ Hagen von Eitzen, Oct 03 2009

More terms from Hagen von Eitzen, Oct 03 2009

A288636 Height of power-tower factorization of n. Row lengths of A278028.

Original entry on oeis.org

0, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1

Offset: 1

Gus Wiseman, Jun 12 2017

nonn

After a(1)=0 this sequence has many terms equal to A089723. It first differs at a(64)=2, A089723(64)=4.

First positions of a(n) = {0, 1, 2, 3, 4} are n = {1, 2, 4, 16, 65536}. - Michael De Vlieger, Nov 24 2017

Michael De Vlieger, Table of n, a(n) for n = 1..65536

Cf. A007916, A089723, A164337, A277562, A277564, A278028.

a[n_] := If[n == 1, 0, 1+a[GCD @@ FactorInteger[n][[All, 2]]]];
Array[a,100]

A277562 Numbers of the form c(x_1)^c(x_2)^...^c(x_k) where each c(i) = A007916(i) is a non-perfect-power, k >= 2, and the exponents are nested from the right.

Original entry on oeis.org

16, 81, 256, 512, 625, 1296, 2401, 6561, 10000, 14641, 19683, 20736, 28561, 38416, 50625, 65536, 83521, 104976, 130321, 160000, 194481, 234256, 279841, 331776, 390625, 456976, 614656, 707281, 810000, 923521, 1185921, 1336336, 1500625, 1679616, 1874161, 1953125, 2085136, 2313441, 2560000, 2825761, 3111696, 3418801

Offset: 1

Gus Wiseman, Oct 19 2016

nonn

Non-perfect-powers, or NPPs (A007916), are numbers whose prime multiplicities are relatively prime. As discussed in A007916, the expansion of a positive integer into a tower of NPPs is unique and always possible. 65536=2^2^2^2 is the smallest number that requires a tower of height more than 3.

			       16 = 2^2^2        81 = 3^2^2       256 = 2^2^3       512 = 2^3^2
      625 = 5^2^2      1296 = 6^2^2      2401 = 7^2^2      6561 = 3^2^3
    10000 = 10^2^2    14641 = 11^2^2    19683 = 3^3^2     20736 = 12^2^2
    28561 = 13^2^2    38416 = 14^2^2    50625 = 15^2^2
    65536 = 2^2^2^2   83521 = 17^2^2   104976 = 18^2^2   130321 = 19^2^2
   160000 = 20^2^2   194481 = 21^2^2   234256 = 22^2^2   279841 = 23^2^2
   331776 = 24^2^2   390625 = 5^2^3    456976 = 26^2^2   614656 = 28^2^2
   707281 = 29^2^2   810000 = 30^2^2   923521 = 31^2^2  1185921 = 33^2^2
  1336336 = 34^2^2  1500625 = 35^2^2  1679616 = 6^2^3   1874161 = 37^2^2
  1953125 = 5^3^2   2085136 = 38^2^2  2313441 = 39^2^2  2560000 = 40^2^2
  2825761 = 41^2^2  3111696 = 42^2^2  3418801 = 43^2^2  3748096 = 44^2^2
  4100625 = 45^2^2  4477456 = 46^2^2  4879681 = 47^2^2  5308416 = 48^2^2
  5764801 = 7^2^3   6250000 = 50^2^2  6765201 = 51^2^2  7311616 = 52^2^2
  7890481 = 53^2^2  8503056 = 54^2^2  9150625 = 55^2^2  9834496 = 56^2^2

David A. Corneth, Table of n, a(n) for n = 1..10025 (terms <= 10^16)
R. K. Guy and J. L. Selfridge, The nesting and roosting habits of the laddered parenthesis, Amer. Math. Monthly 80 (8) (1973), 868-876.
R. K. Guy and J. L. Selfridge, The nesting and roosting habits of the laddered parenthesis (annotated cached copy)

Cf. A007916, A001597, A164336, A164337, A106490 (Quetian Superfactorization).

radicalQ[1]:=False;
radicalQ[n_]:=SameQ[GCD@@FactorInteger[n][[All,2]],1];
hyperfactor[1]:={};
hyperfactor[n_?radicalQ]:={n};
hyperfactor[n_]:=With[{g=GCD@@FactorInteger[n][[All,2]]},Prepend[hyperfactor[g],Product[Apply[Power[#1,#2/g]&,r],{r,FactorInteger[n]}]]];
Select[Range[10^6],Length[hyperfactor[#]]>2&]

Edited by N. J. A. Sloane, Nov 09 2016

Offset changed to 1 by David A. Corneth, Apr 30 2024

A277564 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. The sequence is an irregular triangle read by rows, where the n-th row lists n followed by x_1, ..., x_k.

Original entry on oeis.org

1, 2, 1, 3, 2, 4, 1, 1, 5, 3, 6, 4, 7, 5, 8, 1, 2, 9, 2, 1, 10, 6, 11, 7, 12, 8, 13, 9, 14, 10, 15, 11, 16, 1, 1, 1, 17, 12, 18, 13, 19, 14, 20, 15, 21, 16, 22, 17, 23, 18, 24, 19, 25, 3, 1, 26, 20, 27, 2, 2, 28, 21, 29, 22, 30, 23, 31, 24, 32, 1, 3, 33, 25, 34, 26, 35, 27, 36, 4, 1, 37, 28, 38, 29, 39, 30, 40, 31

Offset: 1

Gus Wiseman, Oct 20 2016

The row lengths are A288636(n) + 1. - Gus Wiseman, Jun 12 2017

See A278028 for a version in which row n simply lists x_1, x_2, ..., x_k (omitting the initial n).

			1 is represented by the empty sequence (), by convention.
Successive rows of the triangle are as follows (c(k) denotes the k-th non-prime-power, A007916(k)):
2, 1,
3, 2,
4, 1, 1,
5, 3,
6, 4, because 6 = c(4)
7, 5,
8, 1, 2, because 8 = 2^3 = c(1)^c(2)
9, 2, 1,
10, 6,
11, 7,
...
16, 1, 1, 1, because 16 = 2^4 = c(1)^4 = c(1)^(c(1)^2) = c[1]^(c[1]^c[1])
17, 12,
...
This sequence represents a bijection N -> Q where Q is the set of all finite sequences of positive integers: 1->(), 2->(1), 3->(2), 4->(1 1), 5->(3), 6->(4), 7->(5), 8->(1 2), 9->(2 1), ...

Gus Wiseman, Table of n, a(n) for n = 1..20131
N. J. A. Sloane, Maple programs for A007916, A278028, A278029, A052409, A089723, A277564

Cf. A007916, A277562, A164336, A000961, A164337, A278028, A089723.

Maple
```
See link.
```

nn=10000;radicalQ[1]:=False;radicalQ[n_]:=SameQ[GCD@@FactorInteger[n][[All,2]],1];
hyperfactor[1]:={};hyperfactor[n_?radicalQ]:={n};hyperfactor[n_]:=With[{g=GCD@@FactorInteger[n][[All,2]]},Prepend[hyperfactor[g],Product[Apply[Power[#1,#2/g]&,r],{r,FactorInteger[n]}]]];
rad[0]:=1;rad[n_?Positive]:=rad[n]=NestWhile[#+1&,rad[n-1]+1,Not[radicalQ[#]]&];Set@@@Array[radPi[rad[#]]==#&,nn];
Flatten[Join[{#},radPi/@hyperfactor[#]]&/@Range[nn]]

Edited by N. J. A. Sloane, Nov 09 2016

A304481 Turn the power-tower for n upside-down.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, May 13 2018

This is an involution of the positive integers.

The power-tower for n is defined as follows. 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)^...^c(x_3)^c(x_2)^c(x_1).

			The power tower of 81 is 3^2^2, which turned upside-down is 2^2^3 = 256, so a(81) = 256.

Robert Israel, Table of n, a(n) for n = 1..10000
N. J. A. Sloane, Maple programs for A007916, A278028, A278029, A052409, A089723, A277564

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

f:= proc(n,r) local F,a,y;
     if n = 1 then return 1 fi;
     F:= ifactors(n)[2];
     y:= igcd(seq(t[2],t=F));
     if y = 1 then return n^r fi;
     a:= mul(t[1]^(t[2]/y),t=F);
     procname(y,a^r)
end proc:
seq(f(n,1),n=1..100); # Robert Israel, May 13 2018

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

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

Original entry on oeis.org

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.

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_1)^c(x_2)^c(x_3)^...^c(x_{k-1}).

			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

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) = x_k.

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)).

A164345 Powers of primes where the exponents are not powers of primes.

Original entry on oeis.org

1, 64, 729, 1024, 4096, 15625, 16384, 32768, 59049, 117649, 262144, 531441, 1048576, 1771561, 2097152, 4194304, 4782969, 4826809, 9765625, 14348907, 16777216, 24137569, 47045881, 67108864, 148035889, 244140625, 268435456

Offset: 1

Leroy Quet, Aug 13 2009

nonn

First differs from A164337, after the initial 1 in this sequence: 2^64 = 18446744073709551616 is in sequence A164337, but is not in this sequence.

This sequence contains those powers of primes that are not in sequence A096165.

			2^12 = 4096. Since 2 is prime, and since 12 is not a power of a prime, then 4096 is in this sequence.

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

Cf. A024619, A096165 (complement with respect to A000961), A164337.

isok(k) = if(k==1, return(1)); my(q=isprimepower(k)); (q>1) && !isprimepower(q); \\ Michel Marcus, Nov 26 2020

Sum_{n>=1} 1/a(n) = 1 + Sum_{k in A024619} P(k) = 1.018407114609068368636..., where P is the prime zeta function. - Amiram Eldar, Nov 26 2020

Extended beyond 16384 by R. J. Mathar, Sep 27 2009

cp's OEIS Frontend

A164336 a(1)=1. Thereafter, all terms are primes raised to the values of earlier terms of the sequence.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Extensions

A288636 Height of power-tower factorization of n. Row lengths of A278028.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A277562 Numbers of the form c(x_1)^c(x_2)^...^c(x_k) where each c(i) = A007916(i) is a non-perfect-power, k >= 2, and the exponents are nested from the right.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Extensions

A304481 Turn the power-tower for n upside-down.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

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