26670

Appears in sequences

• Number of graphs on n nodes with 3 cliques.at n=22A005289
• Number of nonseparable toroidal tree-rooted maps with n + 3 edges and n + 1 vertices.at n=4A006415
• Composite numbers k such that sigma(k)*(phi(k) + 2) is a square.at n=35A065655
• Numbers k such that sum of 9th powers of divisors of k is divisible by the square of Euler-phi of k.at n=7A094468
• Triangle read by rows: T(n,k) is number of labeled bipartite graphs with n nodes and k edges.at n=36A117279
• Weight distribution of [127,22,47] primitive binary BCH code.at n=48A151811
• Half the number of length n integer sequences with sum zero and sum of squares 6498.at n=3A157589
• a(j) = maximum value of n for each distinct increasing value of (Sum of the quadratic non-residues of prime(n) - Sum of the quadratic residues of prime(n)) / prime(n) for each j.at n=23A166263
• a(1)=1; for n>1, a(n) is the smallest positive integer for which sigma(a(n)) is a proper multiple of sigma(a(n-1)).at n=15A237352
• Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=7A252427
• Expansion of e.g.f. 1/(1 - x/(1 - (x^2/2!)/(1 - (x^3/3!)/(1 - (x^4/4!)/(1 - (x^5/5!)/(1 -... (x^n/n!)/(1 -...))))))), a continued fraction.at n=7A257544
• Riordan array (f(x)^4, f(x)), where 1 + x*f^4(x)/(1 - x*f(x)) = f(x).at n=30A263918
• Number of n X 3 0..1 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=6A279461
• Number of nX7 0..1 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=2A279465
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=38A279466
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=42A279466
• Expansion of e.g.f. 1/(1 - x/(1 - x^2/(2 - x^3/(3 - x^4/(4 - x^5/(5 - x^6/(6 - x^7/(7 - ...)))))))), a continued fraction.at n=7A295944
• Number of nX5 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A299525
• Number of nX6 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=4A299526
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=49A299528