19368

Appears in sequences

• Molien series for 9-dimensional group of structure Z_2 X Z_2 and order 4, corresponding to complete weight enumerators of Hermitian self-dual GF(3)-linear codes over GF(9).at n=11A092091
• Number of 9 X 9 arrays of squares of integers, symmetric under 90-degree rotation, with all rows summing to n.at n=12A156401
• Number of n X n arrays of squares of integers, symmetric under 90 degree rotation, with all rows summing to 12.at n=6A156457
• Number of (n+1) X (5+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9.at n=6A234137
• Number of (n+1) X (7+1) 0..3 arrays with every 2 X 2 subblock having the sum of the absolute values of all six edge and diagonal differences equal to 9.at n=4A234139
• Positions of 3's in A234323.at n=49A234804
• Number of nX4 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,0) or (-1,-1) and new values introduced in order 0..2.at n=7A275500
• Number of nonempty subsets of {2..n} whose product is divisible by their sum.at n=17A326172
• Positive numbers k such that k and k + 1 are both positive negaFibonacci-Niven numbers (A331085) and -k and -(k + 1) are both negative negaFibonacci-Niven numbers (A331088).at n=31A331092
• Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8.at n=36A339105
• Successive records of function f(x) = log(abs(pi(x) - R(x)))/log(x) where pi(x) is the number of primes <= x and R(x) is Riemann's prime counting function.at n=51A353055
• Number of connected planar cubic graphs with 2*n nodes and exactly one edge-Kempe equivalence class.at n=8A358285
• Keys added to a map T initialized with T[1] = 1 and updated at each iteration according to T[value] := (T[value] if defined else 0) + key, for all (key, value) pairs already in T; listed in order the keys are added to the map (cf. comments for details).at n=41A390939
• Value of T[4] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[4] isn't defined yet.at n=18A390944