The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A117497

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A117497

Length of shortest sequence b with b(0) = 1, b(i+1) = b(i)+d where d|b(i) and b(k) = n.
(history; published version)

#31 by N. J. A. Sloane at Thu Apr 04 09:59:01 EDT 2024

STATUS

proposed

approved

#30 by Michael De Vlieger at Thu Apr 04 09:58:38 EDT 2024

STATUS

editing

proposed

#29 by Michael De Vlieger at Thu Apr 04 09:58:36 EDT 2024

LINKS

John M. Campbell, <a href="https://arxiv.org/abs/2403.20073">A binary version of the Mahler-Popken complexity function</a>, arXiv:2403.20073 [math.NT], 2024. See pp. 5-6.

STATUS

approved

editing

#28 by Michael De Vlieger at Fri Aug 05 10:50:26 EDT 2022

STATUS

reviewed

approved

#27 by Michel Marcus at Fri Aug 05 09:28:44 EDT 2022

STATUS

proposed

reviewed

#26 by Michel Marcus at Fri Aug 05 05:20:40 EDT 2022

STATUS

editing

proposed

#25 by Michel Marcus at Fri Aug 05 05:20:37 EDT 2022

FORMULA

a(2^n) = n. - R. J. Mathar, Mar 03 2022

STATUS

proposed

editing

#24 by Jean-François Alcover at Fri Aug 05 05:19:17 EDT 2022

STATUS

editing

proposed

#23 by Jean-François Alcover at Fri Aug 05 05:19:11 EDT 2022

MATHEMATICA

a[n_] := a[n] = If[n == 1, 0, With[{m = Log2[n]}, If[IntegerQ[m], m,

1 + Min[a[n-#]& /@ Most[Divisors[n]]]]]];

Table[a[n], {n, 1, 105}] (* Jean-François Alcover, Aug 05 2022 *)

STATUS

approved

editing

#22 by N. J. A. Sloane at Tue May 31 12:51:41 EDT 2022

STATUS

proposed

approved