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.

Showing 1-2 of 2 results.

A343755 Number of regions formed by infinite lines when connecting all vertices and all points that divide the sides of an equilateral triangle into n equal parts.

Original entry on oeis.org

7, 30, 144, 474, 1324, 2934, 5797, 10614, 17424, 27480, 41845, 61602, 85711, 120120, 159213, 207798, 269668, 349272, 434878, 545496, 661764, 804582, 973471, 1174980, 1374646, 1631304, 1908768, 2218254, 2560198, 2976486, 3378985, 3887796, 4405671, 4995240, 5617689, 6322878
Offset: 1

Views

Author

Scott R. Shannon, Jun 28 2021

Keywords

Comments

The count of regions includes both the closed bounded polygons and the open unbounded areas surrounding these polygons with two edges that go to infinity. The number of unbounded areas appears to equal 6*(n^2 - n + 1).
See A344279 for further examples and images of the regions.

Examples

			a(1) = 7 as the three connected vertices of a triangle form one polygon along with six outer unbounded areas, seven regions in total.
a(2) = 30 as when the three vertices and three edges points are connected they form twelve polygons, all inside the triangle, along with eighteen outer unbounded areas, thirty regions in total.
a(2) = 144 as when the three vertices and six edges points are connected they form one hundred two polygons, seventy-five inside the triangle and twenty-seven outside, along with forty-two outer unbounded areas, one hundred forty-four regions in total.
		

Crossrefs

Cf. A344279 (number of polygons), A344657 (number of vertices), A344896 (number of edges), A346446 (number of k-gons), A092867 (number polygons inside the triangle), A121205, A345025.

Formula

Conjectured formula: a(n) = A344279(n) + 6*(n^2 - n + 1).
Conjectured formula: a(n) = A344279(n) + A121205(n-1), for n>=7.

A137201 "Ungodly" numbers: numbers that, in some base b > 6, contain the string 666 at least once in their expansion.

Original entry on oeis.org

342, 438, 546, 666, 685, 798, 942, 950, 1028, 1098, 1266, 1275, 1371, 1446, 1462, 1638, 1666, 1714, 1842, 1974, 2004, 2057, 2058, 2129, 2286, 2394, 2395, 2396, 2397, 2398, 2399, 2400, 2486, 2526, 2666, 2670, 2733, 2743, 2778, 2998, 3042, 3086, 3295
Offset: 1

Views

Author

Joshua Zucker, Mar 04 2008

Keywords

Comments

Max Alekseyev asked if there are an infinite number of godly numbers.

Examples

			342 is in the sequence because 342 = 666_7.
685 is in the sequence because 685 = 1666_7.
99968 is in the sequence because 99968 = 3666B_13.
		

Crossrefs

Cf. A121205 (numbers that in some base b are represented exactly as 666, so it is a subsequence of this sequence).
Showing 1-2 of 2 results.