A100278 Group the terms of A001511 into clumps so that the sum in each clump is just larger than the sum of the previous clump; sequence gives the sums of the clumps.

1, 2, 4, 8, 10, 13, 15, 17, 18, 21, 22, 27, 32, 34, 35, 37, 38, 40, 42, 44, 51, 53, 56, 57, 58, 62, 63, 64, 66, 67, 68, 71, 73, 75, 76, 79, 81, 82, 84, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 100, 104, 106, 108, 109, 110, 111, 112, 113, 114, 116, 120, 121, 123, 128, 130, 133

Offset

1,2

Links

Table of n, a(n) for n=1..66.

Example

1, 2, (1+3), (1+2+1+4), (1+2+1+3+1+2), (1+5+1+2+1+3), (1+2+1+4+1+2+1+3), ...

Prog

(PARI) (mult(n, d)=local(r); r=0; while(n%d==0, n\=d; r++); r); v=[]; l=0; t=0; for(i=1, 10000, t+=1+mult(i, 2); if(t>l, v=concat(v, [t]); l=t; t=0)); v \\ Franklin T. Adams-Watters, May 27 2006

Crossrefs

Cf. A001511.

Sequence in context: A331669 A154788 A219617 * A075333 A297250 A014190

Adjacent sequences: A100275 A100276 A100277 * A100279 A100280 A100281

Keyword

nonn,easy

Author

Jorge Coveiro, Dec 28 2004

Extensions

More terms from Franklin T. Adams-Watters, May 27 2006

Status

approved