OFFSET
1,3
COMMENTS
Only the first four terms are Fibonacci numbers per se. - Alonso del Arte, Oct 05 2017
LINKS
Harry J. Smith, Table of n, a(n) for n=1..500
Ron Knott, The Mathematical Magic of the Fibonacci Numbers.
Index entries for linear recurrences with constant coefficients, signature (-1,1,1,1,1).
FORMULA
a(n) = -a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n+5), for n >= 10. - Amiram Eldar, Jun 24 2023
MATHEMATICA
Union[Table[Fibonacci[i] - 1, {i, 30}], Table[Fibonacci[j] + 1, {j, 0, 30}]]
Union[Flatten[# + {1, -1} &/@ Fibonacci[Range[30]]]] (* Harvey P. Dale, Dec 26 2015 *)
PROG
(PARI) { t="b061489.txt"; for (n=1, 4, write(t, n, " ", n - 1) ); g=3; h=2; for (n=3, 250, f=g + h; h=g; g=f; write(t, 2*n - 1, " ", f - 1); write(t, 2*n, " ", f + 1) ) } \\ Harry J. Smith, Jul 23 2009
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Nov 08 2001
EXTENSIONS
More terms from Robert G. Wilson v, Nov 12 2001
STATUS
approved