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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A347784 Number of compositions (ordered partitions) of n into at most 3 powers of 2. 3
1, 1, 2, 3, 5, 5, 6, 6, 5, 5, 8, 6, 6, 6, 6, 0, 5, 5, 8, 6, 8, 6, 6, 0, 6, 6, 6, 0, 6, 0, 0, 0, 5, 5, 8, 6, 8, 6, 6, 0, 8, 6, 6, 0, 6, 0, 0, 0, 6, 6, 6, 0, 6, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 5, 5, 8, 6, 8, 6, 6, 0, 8, 6, 6, 0, 6, 0, 0, 0, 8, 6, 6, 0, 6, 0, 0, 0, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
MATHEMATICA
Table[Length@Flatten[Permutations/@IntegerPartitions[n, 3, Select[Range@n, IntegerQ@Log2@#&]], 1], {n, 0, 100}] (* Giorgos Kalogeropoulos, Sep 13 2021 *)
CROSSREFS
Sequence in context: A348976 A169787 A165959 * A111164 A255347 A029910
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Sep 13 2021
STATUS
approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 07:42 EDT 2024. Contains 371905 sequences. (Running on oeis4.)