A362361 a(n) = n*2^10 - 3.

1021, 2045, 3069, 4093, 5117, 6141, 7165, 8189, 9213, 10237, 11261, 12285, 13309, 14333, 15357, 16381, 17405, 18429, 19453, 20477, 21501, 22525, 23549, 24573, 25597, 26621, 27645, 28669, 29693, 30717, 31741, 32765

Offset

1,1

Comments

This gives the solution to the Monkey and Coconut Problem (four sailors one coconut to the monkey). For the five sailors one monkey problem see A254029.

This is row s = 4 of the array given in A362359, hence the fourth column of the corresponding triangle T with offset 4.

Links

Paolo Xausa, Table of n, a(n) for n = 1..10000

Index entries for linear recurrences with constant coefficients, signature (2,-1).

Formula

a(n) = n*4^5 - 3, for n >= 1.

O.g.f: (x/(1-x)^2)*(4^5 - 3*(1-x)).

E.g.f.: 3 + exp(x)*(1024*x - 3). - Stefano Spezia, Jun 24 2023

Mathematica

Range[50]2^10-3 (* Paolo Xausa, Nov 17 2023 *)

Prog

(Python)
def A362361(n): return (n<<10)-3 # Chai Wah Wu, Jun 25 2023

Crossrefs

Cf. A254029, A362359, A362360.

Sequence in context: A082059 A081633 A020388 * A306596 A287639 A261676

Adjacent sequences: A362358 A362359 A362360 * A362362 A362363 A362364

Keyword

nonn,easy,less

Author

Richard S. Fischer and Wolfdieter Lang, Jun 20 2023

Status

approved