login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362360 a(n) = 81*n - 2. 3
79, 160, 241, 322, 403, 484, 565, 646, 727, 808, 889, 970, 1051, 1132, 1213, 1294, 1375, 1456, 1537, 1618, 1699, 1780, 1861, 1942, 2023, 2104, 2185, 2266, 2347, 2428, 2509, 2590, 2671, 2752, 2833, 2914, 2995, 3076, 3157 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
This gives the solution to the Monkey and Coconut Problem (three sailors, one coconut to the monkey). For the five sailors, one monkey problem see A254029.
This is row s = 3 of the array A given in A362359, hence the third column of the corresponding triangle T with offset 3.
LINKS
FORMULA
a(n) = 3^4*n - 2, for n >= 1.
O.g.f.: (x/(1-x)^2)*(3^4 - 2*(1-x)).
E.g.f.: 2 + exp(x)*(81*x - 2). - Stefano Spezia, Jun 24 2023
MATHEMATICA
Range[50]81-2 (* Paolo Xausa, Nov 17 2023 *)
CROSSREFS
Sequence in context: A046050 A044330 A044711 * A142307 A142383 A033673
KEYWORD
nonn,easy
AUTHOR
Richard S. Fischer and Wolfdieter Lang, Jun 20 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 4 05:23 EST 2024. Contains 370522 sequences. (Running on oeis4.)