|
|
|
|
|
|
|
|
|
#168 by Joerg Arndt at Sat Dec 30 11:02:03 EST 2023
|
|
|
|
|
|
|
|
#167 by Paolo P. Lava at Sat Dec 30 08:00:53 EST 2023
|
|
| FORMULA
|
a(n+1) = [Sum_{k=1..n} k mod (n+1)] + a(n), with n>=1 and a(1)=1. - Paolo P. Lava, Mar 19 2007
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#166 by N. J. A. Sloane at Wed Nov 08 11:15:51 EST 2023
|
|
|
|
|
|
|
|
#165 by N. J. A. Sloane at Wed Nov 08 11:15:43 EST 2023
|
|
| COMMENTS
|
Consider a regular n-gon with all diagonals drawn. Define a "layer" to asbe the set of all regions sharing an edge with the exterior. Removing a layer creates another layer. Count the layers, removing them until none remain. The number of layers is a(n-2). See illustration. - Christopher Scussel, Nov 07 2023
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Wed Nov 08
| 11:15
| N. J. A. Sloane: edited
|
|
|
|
|
|
|
#164 by Michel Marcus at Wed Nov 08 04:10:01 EST 2023
|
|
|
|
|
|
|
|
#163 by Michel Marcus at Wed Nov 08 04:09:57 EST 2023
|
|
| COMMENTS
|
Consider a regular n-gon with all diagonals drawn. Define a layer as the set of all regions sharing an edge with the exterior. Removing a layer creates another layer. Count the layers, removing them until none remain. See illustration. The number of layers is a(n-2). - _). See illustration. - _Christopher Scussel_, Nov 07 2023
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#162 by Michel Marcus at Tue Nov 07 11:37:23 EST 2023
|
|
|
|
|
|
Discussion
|
| Tue Nov 07
| 11:38
| Michel Marcus: URL's work only on the links section
|
|
|
|
|
|
|
#161 by Michel Marcus at Tue Nov 07 11:37:16 EST 2023
|
|
| COMMENTS
|
Consider a regular n-gon with all diagonals drawn.. Define a layer as the set of all regions sharing an edge with the exterior. Removing a layer creates another layer. Count the layers, removing them until none remain. See illustration. The number of layers is a(n-2). - _Christopher Scussel_, Nov 07 2023
Define a layer as the set of all regions sharing an edge with the exterior.
Removing a layer creates another layer.
Count the layers, removing them until none remain.
(See <a href="/A008805/a008805.pdf">Illustration</a>)
The number of layers is a(n-2). - Christopher Scussel, Nov 07 2023
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#160 by Christopher Scussel at Tue Nov 07 11:31:10 EST 2023
|
|
|
|
|
|
|
|
#159 by Christopher Scussel at Tue Nov 07 11:27:03 EST 2023
|
|
| LINKS
|
Christopher Scussel,, <a href="/A008805/a008805.pdf">Illustration of layers in regular n-gons with all diagonals drawn</a>
<a href="/A008805/a008805.pdf">Illustration of layers in regular n-gons with all diagonals drawn</a>
Christopher Scussel, <a href="/A008805/a008805.pdf">TITLE FOR LINK</a>
|
|
|
|
|
|
