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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A188575 Number of non-complete compositions of n. 6
 0, 1, 1, 4, 8, 14, 31, 63, 129, 248, 509, 1011, 2044, 4089, 8167, 16360, 32725, 65482, 131017, 262176, 524167, 1048678, 2096985, 4194358, 8387802, 16776408, 33550943, 67101615, 134199983, 268399122, 536793004, 1073590077, 2147187353, 4294419287, 8588940438 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..1000 M. Archibald and A. Knopfmacher, The largest missing value in a composition of an integer, Discrete Math., 311 (2011), 723-731. Alois P. Heinz, Plot of (a(n)-2^(n-2))/2^(n-2) for n = 60..1000 FORMULA a(n) = 2^(n-1) - A107429(n) ~ 2^(n-2). - Alois P. Heinz, Dec 06 2014 MAPLE b:= proc(n, i, t) option remember; `if`(n=0, `if`(i=0, t!, 0), `if`(i<1 or n 2^(n-1) -add(b(n, i, 0), i=1..n): seq(a(n), n=1..40); # Alois P. Heinz, Dec 06 2014 MATHEMATICA b[n_, i_, t_] := b[n, i, t] = If[n == 0, If[i == 0, t!, 0], If[i<1 || n

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 September 22 04:01 EDT 2023. Contains 365503 sequences. (Running on oeis4.)