23690

Appears in sequences

• a(n) = position of 3*n^3 in A003072.at n=41A024970
• a(n) = 3*a(n-1) + 4*a(n-2) + a(n-3) with a(0)=2, a(1)=5, a(2)=22.at n=7A215100
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 873", based on the 5-celled von Neumann neighborhood.at n=26A273709
• a(n) = Product_{d|n} prime(d).at n=26A275700
• Number of n X 4 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=6A279705
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=51A279709
• Number of 7Xn 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=3A279714
• Product_{d|n, A007431(d) > 0} prime(A007431(d)), where A007431 is the Möbius transform of Euler's totient function.at n=54A318838
• Square array read by antidiagonals in which T(n,k) is the n-th even number j with the property that the symmetric representation of sigma(j) has k parts.at n=42A320537