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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A161028 Number of partitions of n into Fibonacci numbers where every part appears at least 4 times. 1
 1, 0, 0, 0, 1, 1, 1, 1, 2, 1, 2, 1, 4, 2, 4, 4, 6, 5, 8, 7, 11, 9, 12, 11, 16, 16, 19, 19, 24, 24, 31, 29, 38, 37, 44, 47, 54, 57, 65, 68, 81, 80, 93, 95, 111, 116, 128, 136, 153, 158, 179, 184, 211, 216, 240, 253, 281, 294, 322, 337, 377, 388, 429, 445, 494, 515, 559, 587, 641, 669, 730 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,9 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..10000 (terms n=1..1000 from R. H. Hardin) MAPLE F:= proc(n, i) option remember; (<<0|1>, <1|1>>^n)[1, 2] end: b:= proc(n, i) option remember; `if`(n=0, 1, (f-> `if`(4*f<=n,       add(b(n-j*f, i+1), j=[0, \$4..n/f]), 0))(F(i)))     end: a:= n-> b(n, 2): seq(a(n), n=0..80);  # Alois P. Heinz, Feb 23 2019 CROSSREFS Cf. A000045. Sequence in context: A297294 A161309 A161243 * A161079 A161295 A161270 Adjacent sequences:  A161025 A161026 A161027 * A161029 A161030 A161031 KEYWORD nonn AUTHOR R. H. Hardin, Jun 02 2009 EXTENSIONS a(0)=1 prepended by Alois P. Heinz, Feb 23 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 00:22 EST 2022. Contains 350464 sequences. (Running on oeis4.)