login
A362361
a(n) = n*2^10 - 3.
2
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.
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
KEYWORD
nonn,easy,less
AUTHOR
Richard S. Fischer and Wolfdieter Lang, Jun 20 2023
STATUS
approved