46610

Appears in sequences

• Row sums of triangle A137710.at n=15A137711
• Number of n X n 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=5A281049
• Number of nX6 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=5A281054
• Number of 6Xn 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.at n=5A281061
• Number of nX3 0..1 arrays with every element equal to 0, 1, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=10A299881
• Number of integer solutions (a_1, a_2, ... , a_8) to the equation a_1^2 + 2*a_2^2 + ... + 8*a_8^2 = 3*n.at n=27A320243
• Table read by antidiagonals: Place k equally spaced points on each side of a regular n-gon and join every pair of these n*k points by a chord; T(n,k) (n >= 3, k >= 0) gives the number of vertices in the resulting planar graph.at n=47A367302
• Distinct values of A378664(k) in the order of appearance, when k ranges over those primitively abundant numbers k for which A378664(k) is less than the largest proper divisor of k.at n=39A378740
• a(n) is the number of integers in base n such that all the integers given by their first k digits are divisible by k and which cannot be extended further.at n=11A380359