|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
MATHEMATICA
|
|
|
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
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|