The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A256569 a(n) is the total number of pentagrams in a variant of pentagram fractal after n iterations. 7

%I #10 Apr 02 2015 17:33:10

%S 1,6,21,61,171,461,1181,2951

%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 would be an irregular polygon instead of a pentagon. The construction rule is vertex to vertex expansion. See illustration in the links.

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

%Y Cf. A255870, A256429, A256571.

%K nonn,more

%O 1,2

%A _Kival Ngaokrajang_, Apr 02 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 May 23 05:11 EDT 2024. Contains 372758 sequences. (Running on oeis4.)