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!)
A015051 Let m = A013929(n); then a(n) = smallest k such that m divides k^4. 5
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

0,1

LINKS

Table of n, a(n) for n=0..67.

H. Ibstedt, Surfing on the Ocean of Numbers, Erhus Univ. Press, Vail, 1997.

CROSSREFS

a(n) = A053166(A013929(n)). Cf. A015050, A015049.

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

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 August 10 14:50 EDT 2020. Contains 336381 sequences. (Running on oeis4.)