OFFSET
1,1
COMMENTS
The number 1000000 is in this sequence. There is a famous problem that says that somebody deposited money into a bank 20 times, and each deposit was the sum of the previous two deposits. The final deposit was $1000000. What were the first two deposits? The answer is $154 and $144, leading to this sequence.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..4776
Perplexus Dot Info contributor Ady Tzidon, Twenty deposits.
Index entries for linear recurrences with constant coefficients, signature (1,1).
FORMULA
From Elmo R. Oliveira, Mar 31 2026: (Start)
G.f.: -2*(82*x-5)/(x^2+x-1).
a(n) = a(n-1) + a(n-2) for n > 2.
a(n) = 154*Fibonacci(n) - 10*Fibonacci(n-1). (End)
MAPLE
a:= n-> (<<0|1>, <1|1>>^n.<<-10, 154>>)[1, 1]:
seq(a(n), n=1..33); # Alois P. Heinz, Mar 31 2026
MATHEMATICA
LinearRecurrence[{1, 1}, {154, 144}, 33] (* Michael De Vlieger, Oct 03 2023 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Bobby Jacobs, Jan 11 2017
EXTENSIONS
More terms from Rémy Sigrist, Oct 03 2023
STATUS
approved
