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!)
A358716 a(n) is the number of inequivalent ways to cut an equilateral triangle with edges of size n into equilateral triangles with integer sides. 1
1, 2, 3, 12, 50, 711, 18031, 952013, 92323440 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Similar to A358715, but now we do not regard dissections which differ by a rotation and/or reflection as distinct.

LINKS

Table of n, a(n) for n=1..9.

EXAMPLE

a(3)=3 because of:

/\ /\ /\

/ \ /\/\ /\/\

/ \ / \/\ /\/\/\

CROSSREFS

Cf. A224239, A358715.

Cf. A299705.

Sequence in context: A232864 A307957 A307956 * A002638 A027072 A083746

Adjacent sequences: A358713 A358714 A358715 * A358717 A358718 A358719

KEYWORD

nonn,more

AUTHOR

Craig Knecht and John Mason, Nov 28 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 March 20 21:07 EDT 2023. Contains 361391 sequences. (Running on oeis4.)