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 A362361 #21 Nov 17 2023 08:06:00 %S A362361 1021,2045,3069,4093,5117,6141,7165,8189,9213,10237,11261,12285,13309, %T A362361 14333,15357,16381,17405,18429,19453,20477,21501,22525,23549,24573, %U A362361 25597,26621,27645,28669,29693,30717,31741,32765 %N A362361 a(n) = n*2^10 - 3. %C A362361 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. %C A362361 This is row s = 4 of the array given in A362359, hence the fourth column of the corresponding triangle T with offset 4. %H A362361 Paolo Xausa, <a href="/A362361/b362361.txt">Table of n, a(n) for n = 1..10000</a> %H A362361 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A362361 a(n) = n*4^5 - 3, for n >= 1. %F A362361 O.g.f: (x/(1-x)^2)*(4^5 - 3*(1-x)). %F A362361 E.g.f.: 3 + exp(x)*(1024*x - 3). - _Stefano Spezia_, Jun 24 2023 %t A362361 Range[50]2^10-3 (* _Paolo Xausa_, Nov 17 2023 *) %o A362361 (Python) %o A362361 def A362361(n): return (n<<10)-3 # _Chai Wah Wu_, Jun 25 2023 %Y A362361 Cf. A254029, A362359, A362360. %K A362361 nonn,easy,less %O A362361 1,1 %A A362361 Richard S. Fischer and _Wolfdieter Lang_, Jun 20 2023