login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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. 7

%I #10 Feb 26 2019 09:09:08

%S 1,765257552,4858337151,62987487698944,14281197489647865625,

%T 16756687971893376,956884714362661,292452281337511936,

%U 11897243269649199,1,824281567746336491,13552472793415699584,841944776182612378933,9434962871842528764976

%N 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.

%C Is every term positive?

%H Rémy Sigrist, <a href="/A306569/b306569.txt">Table of n, a(n) for n = 1..250</a>

%H Rémy Sigrist, <a href="/A306569/a306569.gp.txt">PARI program for A306569</a>

%F a(10^k) = 1 for any k >= 0.

%F a(10*n) = a(n) for any n > 0.

%e a(2) = max(A242350) = 765257552.

%o (PARI) See Links section.

%Y See A306567 for the additive variant.

%Y Cf. A004719, A242350.

%K nonn,base

%O 1,2

%A _Rémy Sigrist_, Feb 24 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 04:12 EDT 2024. Contains 371782 sequences. (Running on oeis4.)