68320

Appears in sequences

• Number of ways of writing n as a sum of 7 squares.at n=27A008451
• Triangle T(n,k) (n >= 2, 2 <= k <= n-1 if n > 2) giving number of non-crossing trees with n nodes and k endpoints.at n=31A072247
• (a(2n+1)+a(2n))^2 = a(2n+1) a(2n) (concatenated, not multiplied).at n=33A112268
• a(n) = 441*n^2 - 488*n + 135.at n=12A157730
• Numbers k such that sopfr(k + omega(k)) = sopfr(k), where sopfr(i) = A001414(i) and omega(i) = A001221(i).at n=37A187878
• Left part of the square of the n-th Kaprekar number.at n=21A194218
• Number of isomorphism classes of connected 3-regular loopless multigraphs with n vertices and with semi-edges allowed.at n=11A243391
• Number of isomorphism classes of connected 3-regular simple graphs of order 2n with loops and semi-edges allowed.at n=11A243392
• Number of (n+2)X(n+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 1 or 4.at n=3A252285
• Number of (n+2)X(4+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 1 or 4.at n=3A252289
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 0 1 or 4.at n=24A252293
• Numbers k such that 6*5^k - 1 is prime.at n=24A257790
• E.g.f.: Limit_{N->oo} [ Sum_{n>=0} (N + n*y)^(2*n) * (x/N)^n/n! ]^(1/N).at n=31A266488
• Numbers k such that (32*10^k + 319)/9 is prime.at n=21A293856
• Number of unlabeled connected loopless multigraphs with n nodes of degree 3 or less and with single or double edges.at n=12A303030
• Position of first appearance of zero in the n-th differences of the prime-powers (A246655), or 0 if it does not appear.at n=14A377055