Minimum number of different addends occurring in any shortest addition chain of Brauer type for a given n, or 0 if n has no shortest addition chain of Brauer type.
A086833
Minimum number of different addends occurring in any shortest addition chain of Brauer type for a given n, or 0 if n has no shortest addition chain of Brauer type.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =2a(6) =2a(7) =3a(8) =2a(9) =3a(10) =3a(11) =3a(12) =3a(13) =3a(14) =3a(15) =4a(16) =4a(17) =3a(18) =3a(19) =4a(20) =3a(21) =4a(22) =5a(23) =4a(24) =4a(25) =4a(26) =3a(27) =4a(28) =4a(29) =4
External references
- oeis: A086833