login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A289023 Position in the sequence of numbers that are not perfect powers (A007916) of the smallest positive integer x such that for some positive integer y we have n = x^y (A052410). 8
1, 2, 1, 3, 4, 5, 1, 2, 6, 7, 8, 9, 10, 11, 1, 12, 13, 14, 15, 16, 17, 18, 19, 3, 20, 2, 21, 22, 23, 24, 1, 25, 26, 27, 4, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 5, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 1, 54, 55, 56, 57, 58, 59, 60 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

COMMENTS

Every pair p of positive integers is of the form p = (a(n), A052409(n)) for exactly one n.

LINKS

Table of n, a(n) for n=2..71.

FORMULA

For n>1 we have a(n) = A278028(n,1).

EXAMPLE

a(27)=2 because the smallest root of 27 is 3, and 3 is the 2nd entry of A007916.

a(25)=3 because the smallest root of 25 is 5, and 5 is the 3rd entry of A007916.

MATHEMATICA

nn=100;

q=Table[Power[n, 1/GCD@@FactorInteger[n][[All, 2]]], {n, 2, nn}];

q/.Table[Union[q][[i]]->i, {i, Length[Union[q]]}]

PROG

(PARI) a(n) = if (ispower(n, , &r), x = r, x = n); sum(k=2, x, ispower(k)==0); \\ Michel Marcus, Jul 19 2017

CROSSREFS

Cf. A007916, A052409, A052410, A278028, A288636.

Sequence in context: A332723 A210040 A285329 * A085985 A331747 A285107

Adjacent sequences:  A289020 A289021 A289022 * A289024 A289025 A289026

KEYWORD

nonn

AUTHOR

Gus Wiseman, Jun 22 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 21 19:57 EDT 2020. Contains 337273 sequences. (Running on oeis4.)