OFFSET
1,2
COMMENTS
This sequence contains all positive Fibonacci numbers of A000045. Proof: For i >= 2, (F(i-2) + F(i+1))/2 = (F(i-2) + F(i-1) + F(i))/2 = (F(i-2) + F(i-1) + F(i-2) + F(i-1))/2 = F(i-1) + F(i-2) = F(i).
LINKS
Felix Huber, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Fibonacci Number
EXAMPLE
1 is in the sequence because (F(0) + F(3))/2 = (0 + 2)/2 = 1.
12 is in the sequence because (F(4) + F(8))/2 = (3 + 21)/2 = 12.
MAPLE
CROSSREFS
KEYWORD
nonn
AUTHOR
Felix Huber, Dec 18 2024
STATUS
approved