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

%I #17 Nov 17 2023 08:06:16

%S 79,160,241,322,403,484,565,646,727,808,889,970,1051,1132,1213,1294,

%T 1375,1456,1537,1618,1699,1780,1861,1942,2023,2104,2185,2266,2347,

%U 2428,2509,2590,2671,2752,2833,2914,2995,3076,3157

%N a(n) = 81*n - 2.

%C 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.

%C This is row s = 3 of the array A given in A362359, hence the third column of the corresponding triangle T with offset 3.

%H Paolo Xausa, <a href="/A362360/b362360.txt">Table of n, a(n) for n = 1..10000</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F a(n) = 3^4*n - 2, for n >= 1.

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

%F E.g.f.: 2 + exp(x)*(81*x - 2). - _Stefano Spezia_, Jun 24 2023

%t Range[50]81-2 (* _Paolo Xausa_, Nov 17 2023 *)

%Y Cf. A254029, A362359.

%K nonn,easy

%O 1,1

%A Richard S. Fischer and _Wolfdieter Lang_, Jun 20 2023

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 April 12 10:04 EDT 2024. Contains 371627 sequences. (Running on oeis4.)