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!)
A359631 a(n) is the smallest positive integer which can be represented as the sum of distinct positive Fibonacci n-step numbers (with a single type of 1) in exactly n ways, or -1 if no such integer exists. 0
1, 3, 44, 416, 26815, 464031 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Fibonacci n-Step Number
EXAMPLE
For n = 2: 3 = Fibonacci(4) = 3 = Fibonacci(2) + Fibonacci(3) = 1 + 2.
CROSSREFS
Sequence in context: A327360 A092545 A353878 * A011916 A337249 A259785
KEYWORD
nonn,more
AUTHOR
Ilya Gutkovskiy, Jan 08 2023
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 May 4 12:19 EDT 2024. Contains 372243 sequences. (Running on oeis4.)