OFFSET
0,3
COMMENTS
Lexicographically earliest reordering of the nonnegative integers (can be extended by symmetry to a permutation of all integers) such that a(2n+1) = a(2n) + a(2n-1).
LINKS
MATHEMATICA
a[0] = 0; a[1] = 1;
a[n_?OddQ] := a[n] = a[n - 1] + a[n - 2];
a[n_?EvenQ] := a[n] = For[k = 2, True, k++,
If[FreeQ[Array[a, n - 1], k], Return[k]]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Dec 02 2021 *)
PROG
(PARI) {used=[]; print1(b=0); a=1; for(i=1, 99, used=setunion(used, Set(a+=b)); while(setsearch(used, b++), used=setminus(used, Set(b))); print1(", "a", "b))}
(Haskell)
import Data.List (transpose)
a167151 n = a167151_list !! n
a167151_list = 0 : concat (transpose [a005228_list, a030124_list])
-- Reinhard Zumkeller, May 17 2013
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
M. F. Hasler, Nov 01 2009
STATUS
approved