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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214625 Let n=r_1*r_2*...*r_k is Fermi-Dirac factorization of n (see comment). Set g(n) = n + k - 1 and g_i, i>=0 (g_0(n) = n, g_1=g), is i-th iteration of g. a(n) is the minimal i such that g_i(n) is in A050376. 1
 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 2, 1, 0, 0, 1, 0, 3, 2, 1, 0, 4, 0, 3, 2, 1, 0, 6, 0, 5, 4, 3, 2, 1, 0, 7, 6, 5, 0, 4, 0, 3, 2, 1, 0, 1, 0, 3, 2, 1, 0, 3, 3, 2, 2, 1, 0, 16, 0, 15, 14, 13, 12, 11, 0, 10, 9, 8, 0, 7, 0, 6, 5, 4, 3, 2, 0, 1, 0, 1, 0, 13, 13 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,13 COMMENTS Recall that every n>=2 has a unique factorization over distinct numbers from A050376 which is called Fermi-Dirac factorization of n. The sequence is a dual to A213980. Conjecture: a(n) exists for every n >= 2. LINKS Amiram Eldar, Table of n, a(n) for n = 2..10000 EXAMPLE Since 24 = 2*3*4, then g_1(24) = 24 + 3 - 1 = 26; analogously, g_1(26) = 26 +2 -1 = 27, g_1(27) = 27 + 2 - 1 = 28, g_1(28) = 28 + 2 - 1 = 29 is in A050376. We used 4 iterations, therefore, a(24) = 4. MATHEMATICA f[1]=0; f[n_] := Plus @@ (DigitCount[Last /@ FactorInteger[n], 2, 1]); g[n_] := n + f[n] - 1; a[n_] := Length @ FixedPointList[g, n]; Array[a, 30] (* Amiram Eldar, Sep 17 2019 *) CROSSREFS Cf. A050376, A213980. Sequence in context: A096608 A155102 A237621 * A363339 A334195 A348446 Adjacent sequences: A214622 A214623 A214624 * A214626 A214627 A214628 KEYWORD nonn AUTHOR Vladimir Shevelev, Feb 16 2013 EXTENSIONS a(63) corrected by Amiram Eldar, Sep 17 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 29 00:31 EST 2023. Contains 367422 sequences. (Running on oeis4.)