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!)
A271858 Number of ways to trisect a triangle with side length n exactly into three identical parts in a triangular lattice. 0
0, 1, 1, 2, 5, 20, 56, 276, 2136, 13756, 148352, 2727448, 41044816, 1056334024, 46033137324 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
In the case that n is not divisible by 3 the central triangle is removed, otherwise the dissection would not be possible.
LINKS
G. P. Jelliss, Trisected Triangles, The Games and Puzzles Journal, Issue 22, January-April 2002.
CROSSREFS
Sequence in context: A168541 A124264 A274239 * A189734 A221678 A297350
KEYWORD
nonn,more
AUTHOR
Andrew Howroyd, Apr 15 2016
STATUS
approved

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 25 14:35 EDT 2024. Contains 371989 sequences. (Running on oeis4.)