cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A362360 a(n) = 81*n - 2.

Original entry on oeis.org

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
Offset: 1

Views

Author

Richard S. Fischer and Wolfdieter Lang, Jun 20 2023

Keywords

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.

Crossrefs

Programs

  • Mathematica
    Range[50]81-2 (* Paolo Xausa, Nov 17 2023 *)

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

A362361 a(n) = n*2^10 - 3.

Original entry on oeis.org

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

Views

Author

Richard S. Fischer and Wolfdieter Lang, Jun 20 2023

Keywords

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.

Crossrefs

Programs

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
Showing 1-2 of 2 results.