22592

Appears in sequences

• Discriminants of totally complex sextic fields (negated).at n=16A023687
• Denominator of fraction equal to the continued fraction [ 3, 1, 4, 1, 5... ] (first n digits of Pi).at n=8A036254
• a(n) is the smallest positive integer k such that d(k) = d(k+n) = 2*n, where d(m) (A000005) is the number of positive divisors of m, or 0 if no such k exists.at n=6A137532
• Numbers n such that d(1)^1 + d(2)^2 + ... + d(p)^p and d(1)^p + d(2)^p-1 +... + d(p)^1 are squares, where d(i), i=1..p, are the digits of n.at n=45A178360
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..4 array extended with zeros and convolved with 1,2,2,1.at n=21A222107
• Number of (n+1)X(1+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59.at n=3A233853
• Number of (n+1)X(4+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59.at n=0A233856
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59 (59 maximizes T(1,1)).at n=6A233859
• T(n,k)=Number of (n+1)X(k+1) 0..7 arrays with every 2X2 subblock having the sum of the squares of all six edge and diagonal differences equal to 59 (59 maximizes T(1,1)).at n=9A233859
• Number of nX2 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=6A239995
• T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=34A240000
• Number of 7 X n 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest, modulo 4.at n=1A240006
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 313", based on the 5-celled von Neumann neighborhood.at n=31A271202
• Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the white squares of an n X n board with every square controlled by at least one bishop (1<=k<n).at n=64A288182
• Triangle read by rows: T(n,k) = number of arrangements of k non-attacking bishops on the black squares of an n X n board with every square controlled by at least one bishop.at n=64A288183
• G.f. C(x) satisfies: Sum_{n>=0} (-1)^n * n * ( C(C(x)) - (-1)^n*C(C(-x)) )^n = 0.at n=6A318642
• Number of multiset partitions of integer partitions of n such that all blocks have odd size.at n=19A356932
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,0) = 0^n and T(n,k) = k * Sum_{r=0..n} binomial(n,r) * binomial(n+2*r+k,n)/(n+2*r+k) for k > 0.at n=50A378236