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!)
 A073753 a(n) = A073752(A073752(n)), where A073752(n) = gcd(n/spf(n), n/gpf(n)), with spf(n) as the smallest and gpf(n) as the greatest prime factor of n (see A020639, A006530). 3
 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 4, 9, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 COMMENTS a(n) = A062378(n) for n<90, but a(90)=3 <> A062378(90)=1. LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A073752(A073752(n)). CROSSREFS Cf. A006530, A020639, A073752. Differs from A062378 for the first time at n=90. Sequence in context: A204133 A342017 A062378 * A290602 A255404 A078090 Adjacent sequences:  A073750 A073751 A073752 * A073754 A073755 A073756 KEYWORD nonn AUTHOR Reinhard Zumkeller, Aug 07 2002 EXTENSIONS Name edited by Antti Karttunen, Sep 23 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.

Last modified April 11 14:10 EDT 2021. Contains 342886 sequences. (Running on oeis4.)