login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A292150 Number of distinct convex octagons that can be formed from n congruent isosceles right triangles. Reflections are not counted as distinct. 2

%I

%S 0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,1,0,0,1,1,0,1,0,3,0,1,1,1,

%T 1,1,1,5,0,3,1,1,1,3,3,5,1,1,2,8,1,3,2,7,3,3,5,4,2,8,3,12,2,4,7,7,3,6,

%U 6,15,3,5,8,12,7,9,5,15,4,12,11,11,7,6

%N Number of distinct convex octagons that can be formed from n congruent isosceles right triangles. Reflections are not counted as distinct.

%C Illustrated with other convex polyabolos in A245676.

%H Douglas J. Durian, <a href="/A292150/b292150.txt">Table of n, a(n) for n = 1..750</a>

%e The smallest convex octagonal polyabolos are for n = 14 and n = 20; both are symmetrical.

%Y Strictly less than A245676.

%K nonn

%O 1,30

%A _Douglas J. Durian_, Sep 13 2017

%E a(33) and beyond from _Douglas J. Durian_, Jan 25 2020

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 20 10:43 EDT 2021. Contains 348100 sequences. (Running on oeis4.)