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!)
A358715 a(n) is the number of distinct ways to cut an equilateral triangle with edges of size n into equilateral triangles with integer sides. 1
1, 2, 5, 26, 220, 3622, 105859, 5677789, 553715341, 98404068313, 31850967186980, 18779046566454536, 20167518569123722322, 39451359692134386945019 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
In other words, the number of equilateral triangular tilings of an equilateral triangle, where rotations and reflections are considered distinct.
LINKS
MAPLE
a(3)=5 because of:
/\ /\ /\ /\ /\
/ \ /\/\ / \ /\/\ /\/\
/ \ / \/\ /\/\/\ /\/ \ /\/\/\
CROSSREFS
Sequence in context: A072268 A019014 A128595 * A180749 A323299 A111195
KEYWORD
nonn,more
AUTHOR
Craig Knecht and John Mason, Nov 28 2022
EXTENSIONS
a(10)-a(14) from Walter Trump, Dec 03 2022
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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)