login
A306216
Successive concatenation of the current sequence with the first differences of the sequence, a(1) = a(2) = 1.
1
1, 1, 0, 0, -1, 0, -1, 0, -1, 0, -1, 0, -1, 1, -1, 1, -1, 0, -1, 0, -1, 1, -1, 1, -1, 1, -1, 1, -1, 2, -2, 2, -2, 0, -1, 0, -1, 1, -1, 1, -1, 1, -1, 1, -1, 2, -2, 2, -2, 1, -1, 1, -1, 2, -2, 2, -2, 2, -2, 2, -2, 3, -4, 4, -4, 0, -1, 0, -1, 1, -1, 1, -1, 1, -1
OFFSET
1,30
COMMENTS
n | generation | first differences
--+------------------------+-------------------
1 | [1,1] | [0]
2 | [1,1,0] | [0,-1]
3 | [1,1,0,0,-1] | [0,-1,0,-1]
4 | [1,1,0,0,-1,0,-1,0,-1] | [0,-1,0,-1,1,-1,1,-1]
LINKS
Peter Kagey, Table of n, a(n) for n = 1..8193 (first 14 generations)
MATHEMATICA
Nest[Join[#, Differences@ #] &, {1, 1}, 7] (* Michael De Vlieger, Jan 29 2019 *)
PROG
(Ruby)
generations = 10
(1...generations).reduce([1, 1]) do |s, _|
s += s.each_cons(2).map { |a, b| b - a }
end
(Haskell)
a306216_list = 1 : 1 : concat (Data.List.unfoldr nextGeneration [1, 1]) where
nextGeneration l = Just (diff l, l ++ diff l)
diff xs = zipWith subtract xs (tail xs)
CROSSREFS
Sequence in context: A122879 A037866 A333181 * A238451 A205777 A053398
KEYWORD
sign,look
AUTHOR
Peter Kagey, Jan 29 2019
STATUS
approved