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

%I #17 Apr 08 2015 12:28:22

%S 1,11,76,436,2441

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

%C Inspired by A255870. But the scale factor is tan(Pi/10) instead of 1/phi.

%C See illustration in the links.

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

%Y Cf. A255870, A256429, A256569, A256571, A256582, A256583.

%K nonn,more

%O 1,2

%A _Kival Ngaokrajang_, Apr 04 2015

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 19 12:14 EDT 2024. Contains 371792 sequences. (Running on oeis4.)