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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A008057 Smallest sum of an addition chain for 2n+1. 1
 0, 5, 10, 16, 20, 27, 31, 35, 40, 47, 51, 56, 60, 65, 74, 78, 80, 86, 92, 96, 102, 106, 110, 120, 121, 125, 134, 137, 142, 148, 153, 156, 160, 167, 171, 182, 184, 185, 192, 201, 200, 206, 210, 219, 227, 231, 233 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Table of n, a(n) for n=0..46. H. Zantema, Minimizing sums of addition chains, RUU-CS-89-15 (1989). H. Zantema, Minimizing sums of addition chains, J. Algorithms 12 (1991) 281-307. Index to sequences related to the complexity of n EXAMPLE The smallest chain for 5 is 2, 3, 5 with sum a(2) = 2+3+5 = 10. the smallest chain for 7 is 2, 3, 4, 7 with sum a(3) = 2+3+4+7 = 16. PROG (PARI) step(V)=my(U=List(), v); for(i=1, #V, v=V[i]; for(i=1, #v, for(j=i, #v, if(v[i]+v[j]>v[#v], listput(U, concat(v, v[i]+v[j])))))); vecsort(Vec(U), , 8) sm(v)=sum(i=2, #v, v[i]) a(n)=if(n<2, return(5*n)); n=2*n+1; my(V=[[1, 2]], U, t); while(#(U=select(v->v[#v]==n, V))==0, V=select(v->v[#v]<=n, step(V))); t=vecmin(apply(sm, U)); while(#V, V=step(select(v->sm(v)

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 March 1 08:00 EST 2024. Contains 370430 sequences. (Running on oeis4.)