20970

Appears in sequences

• Period of continued fraction for square roots of primorials.at n=15A064486
• Number of polyominoes consisting of 6 regular unit n-gons.at n=19A103472
• Sum of the squares of numbers of nonconsecutive tableaux over all partitions of n.at n=9A214087
• Number of nX2 arrays containing 2 copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.at n=6A267832
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.at n=34A267836
• Number of ways to remove n oranges from an infinite stack of oranges whose m-th layer is an m X m square.at n=14A274582
• The number of edges formed when every pair of n points, placed at the vertices of a regular n-gon, are connected by a circle and where the points lie at the ends of the circle's diameter.at n=16A358783
• Let G_n denote the planar graph defined in A358746 with the addition, if n is odd, of the circle containing the initial n points; sequence gives the number of edges in G_n.at n=17A370977
• Number of edges in the directed graph for the Reversed Zeckendorf game with starting number n.at n=49A389617