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!)
A256571 a(n) is the total number of pentagrams in a variant of pentagram fractal after n iterations. 7

%I #24 Jan 28 2023 12:05:07

%S 1,6,21,56,131,281,556,1046,1896,3346,5796,9916,16806,28316,47506

%N a(n) is the total number of pentagrams in a variant of pentagram fractal after n iterations.

%C Inspired by A255870. But at the higher iterations, the perimeter is an irregular polygon instead of a pentagon. The construction rule is sides to vertices expansion. See illustration in the links.

%H Kival Ngaokrajang, <a href="/A256571/a256571.pdf">Illustration of initial terms</a>

%Y Cf. A255870, A256429, A256569.

%K nonn,more

%O 1,2

%A _Kival Ngaokrajang_, Apr 02 2015

%E a(9) corrected and a(10)-a(15) added by _Udo Vieth_, Jan 16 2023

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 27 20:19 EDT 2024. Contains 372020 sequences. (Running on oeis4.)