This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A306569 a(n) is the largest value obtained by iterating x -> noz(x * n) starting from 1 (where noz(k) = A004719(k) omits the zeros from k) if any, otherwise a(n) = -1. 2
 1, 765257552, 4858337151, 62987487698944, 14281197489647865625, 16756687971893376, 956884714362661, 292452281337511936, 11897243269649199, 1, 824281567746336491, 13552472793415699584, 841944776182612378933, 9434962871842528764976 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Is every term positive? LINKS Rémy Sigrist, Table of n, a(n) for n = 1..250 Rémy Sigrist, PARI program for A306569 FORMULA a(10^k) = 1 for any k >= 0. a(10*n) = a(n) for any n > 0. EXAMPLE a(2) = max(A242350) = 765257552. PROG (PARI) See Links section. CROSSREFS See A306567 for the additive variant. Cf. A004719, A242350. Sequence in context: A015370 A068725 A104932 * A118876 A157788 A058420 Adjacent sequences:  A306566 A306567 A306568 * A306570 A306571 A306572 KEYWORD nonn,base AUTHOR Rémy Sigrist, Feb 24 2019 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 20 22:22 EDT 2019. Contains 322310 sequences. (Running on oeis4.)