cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Kyle M. Zimmer

Kyle M. Zimmer's wiki page.

Kyle M. Zimmer has authored 1 sequences.

A250128 Number of triforces generated at iteration n in a Koch-SierpiƄski Ninja Star.

Original entry on oeis.org

0, 1, 3, 9, 30, 96, 309, 996, 3207, 10329, 33267, 107142, 345072, 1111371, 3579384, 11528097, 37128459, 119579361, 385128390, 1240380240, 3994883733
Offset: 0

Author

Kyle M. Zimmer, Nov 12 2014

Keywords

Comments

This sequence describes the number of triangles produced in each iteration of the fractal that is generated by nesting two-dimensional trees of valency three inside one another geometrically.

Programs

  • Java
    // See links.

Formula

Refer to the blog link.
Conjecture: a(n) = 2*a(n-1) + 3*a(n-2) + 3*a(n-3). - Colin Barker, Nov 13 2014
Empirical g.f.: -x*(x+1) / (3*x^3 + 3*x^2 + 2*x - 1). - Colin Barker, Nov 13 2014
Empirical: a(n) = A077832(n-2) + A077832(n-1). - R. J. Mathar, May 21 2018