A378785 a(1)=1, a(2)=2, then when n is a Fibonacci number F(k+1), the next F(k) terms are the first F(k) terms increased by a(n) and put in reverse order.

1, 2, 3, 5, 4, 7, 6, 5, 9, 10, 8, 7, 6, 11, 12, 13, 10, 11, 9, 8, 7, 13, 14, 15, 17, 16, 12, 13, 14, 11, 12, 10, 9, 8, 15, 16, 17, 19, 18, 21, 20, 19, 14, 15, 16, 18, 17, 13, 14, 15, 12, 13, 11, 10, 9, 17, 18, 19, 21, 20, 23, 22, 21, 25, 26, 24, 23, 22, 16, 17, 18, 20, 19, 22, 21

Offset

1,2

Links

Ivan Neretin, Table of n, a(n) for n = 1..10946

Example

The first five terms are 1, 2, 3, 5, 4. Hence the next three terms are (1+4, 2+4, 3+4) taken in reverse order, that is: 7, 6, 5.

Mathematica

Flatten@Nest[{Flatten@#, Reverse[#[[1]]] + #[[2, -1]]} &, {{1}, {2}}, 8]

Crossrefs

Cf. A378784 (analog based on the powers of 2).

Sequence in context: A145391 A371479 A057756 * A340477 A340401 A160051

Adjacent sequences: A378782 A378783 A378784 * A378786 A378787 A378788

Keyword

nonn

Author

Ivan Neretin, Dec 07 2024

Status

approved