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!)
 A043754 Let L(n) = n-th lucky number. Then a(1)=0; a(n) is largest number m such that all divisors of L(n)^m are lucky numbers. 0
 0, 2, 2, 1, 2, 0, 1, 0, 3, 0, 4, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 2, 0, 0, 1, 0, 0, 0, 0, 2, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS EXAMPLE To get a(3) we compute L(3)=7, divisors of 7^2 are 1, 7, 49. They are lucky numbers but 7^3 is not, so a(3)=2. CROSSREFS Cf. A000959. Sequence in context: A039965 A300481 A074942 * A144191 A288007 A145783 Adjacent sequences:  A043751 A043752 A043753 * A043755 A043756 A043757 KEYWORD nonn AUTHOR Naohiro Nomoto, Oct 08 2000 EXTENSIONS More terms from Sascha Kurz, Oct 14 2001 Offset changed to 1 and more terms from Jinyuan Wang, Sep 05 2020 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 January 24 08:21 EST 2021. Contains 340398 sequences. (Running on oeis4.)