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!)
A372049 a(n) is the index of the Lucas number that is the ratio of the sum of the first n Fibonacci numbers divided by the largest possible Fibonacci number. 4
1, 1, 0, 4, 3, 3, 5, 6, 5, 5, 7, 8, 7, 7, 9, 10, 9, 9, 11, 12, 11, 11, 13, 14, 13, 13, 15, 16, 15, 15, 17, 18, 17, 17, 19, 20, 19, 19, 21, 22, 21, 21, 23, 24, 23, 23, 25, 26, 25, 25, 27, 28, 27, 27, 29, 30, 29, 29, 31, 32, 31, 31, 33, 34, 33, 33, 35, 36, 35, 35, 37, 38, 37, 37, 39, 40, 39, 39, 41, 42, 41 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
The sum of the first n Fibonacci numbers is sequence A000071.
When we divide the sum by the largest Fibonacci number that divides the sum, we always get a Lucas number.
For n > 3, a(n+4) = a(n)+2.
LINKS
EXAMPLE
The sum of the first ten Fibonacci numbers is 143. The largest Fibonacci that divides this sum is 13, the seventh Fibonacci number. After the division we get 143/13 = 11, the fifth Lucas number. Thus, a(10) = 5.
CROSSREFS
Sequence in context: A362123 A052360 A263046 * A154913 A154915 A238376
KEYWORD
nonn
AUTHOR
Tanya Khovanova and MIT PRIMES senior group, Apr 17 2024
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 June 25 21:12 EDT 2024. Contains 373712 sequences. (Running on oeis4.)