This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A362360 #17 Nov 17 2023 08:06:16 %S A362360 79,160,241,322,403,484,565,646,727,808,889,970,1051,1132,1213,1294, %T A362360 1375,1456,1537,1618,1699,1780,1861,1942,2023,2104,2185,2266,2347, %U A362360 2428,2509,2590,2671,2752,2833,2914,2995,3076,3157 %N A362360 a(n) = 81*n - 2. %C A362360 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 A362360 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 A362360 Paolo Xausa, <a href="/A362360/b362360.txt">Table of n, a(n) for n = 1..10000</a> %H A362360 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A362360 a(n) = 3^4*n - 2, for n >= 1. %F A362360 O.g.f.: (x/(1-x)^2)*(3^4 - 2*(1-x)). %F A362360 E.g.f.: 2 + exp(x)*(81*x - 2). - _Stefano Spezia_, Jun 24 2023 %t A362360 Range[50]81-2 (* _Paolo Xausa_, Nov 17 2023 *) %Y A362360 Cf. A254029, A362359. %K A362360 nonn,easy %O A362360 1,1 %A A362360 Richard S. Fischer and _Wolfdieter Lang_, Jun 20 2023