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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A015051 Let m = A013929(n); then a(n) = smallest k such that m divides k^4. 6
 2, 2, 3, 6, 2, 6, 10, 6, 5, 3, 14, 4, 6, 10, 22, 15, 6, 7, 10, 26, 6, 14, 30, 21, 4, 34, 6, 15, 38, 10, 3, 42, 22, 30, 46, 12, 14, 33, 10, 26, 6, 14, 58, 39, 30, 11, 62, 5, 42, 4, 66, 15, 34, 70, 6, 21, 74, 30, 38, 51, 78, 20, 6, 82, 42, 13, 57, 86 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Amiram Eldar, Table of n, a(n) for n = 1..10000 Henry Ibstedt, Surfing on the Ocean of Numbers, Erhus Univ. Press, Vail, 1997. FORMULA a(n) = A053166(A013929(n)). MATHEMATICA f[p_, e_] := p^Ceiling[e/4]; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; s /@ Select[Range[200], !SquareFreeQ[#] &] (* Amiram Eldar, Feb 10 2021 *) CROSSREFS Cf. A013929, A015050, A015049, A053166. Sequence in context: A209157 A284785 A076333 * A260389 A291372 A064426 Adjacent sequences:  A015048 A015049 A015050 * A015052 A015053 A015054 KEYWORD nonn AUTHOR R. Muller EXTENSIONS Description corrected by Diego Torres (torresvillarroel(AT)hotmail.com), Jun 23 2002 Offset corrected by Amiram Eldar, Feb 10 2021 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.

Last modified June 13 12:28 EDT 2021. Contains 344996 sequences. (Running on oeis4.)