18930

Appears in sequences

• a(0) = 1, a(n) = 28*n^2 + 2 for n>0.at n=26A010018
• Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, up to rotational symmetry.at n=11A054771
• Coordination sequence for 8-dimensional cyclotomic lattice Z[zeta_30].at n=4A126922
• Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases.at n=7A207044
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases.at n=37A207050
• Principal diagonal of the convolution array A213828.at n=14A213829
• Smallest number k such that P = k*prime(n+1)*(prime(n)-1)+1, Q = k*prime(n+1)*P+1, R = (prime(n)-1)*Q+1 and P, Q, and R are all prime numbers.at n=38A245016
• Number of (n+2)X(1+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3X3 column and antidiagonal sum not equal to 0 2 3 6 or 7.at n=18A252525
• Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000101 00010001 or 00010101.at n=9A260602
• Least positive integer k such that (k-1)^2+(k*n)^2, k^2+(k*n-1)^2, (k+1)^2+(k*n)^2 and k^2+(k*n+1)^2 are all prime.at n=57A261382
• Numbers n such that the decimal digits of n-phi(n) are a permutation of those of n.at n=37A273799
• Number of n X 2 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=6A277782
• Number of nX7 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=1A277787
• T(n,k)=Number of nXk 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=29A277788
• T(n,k)=Number of nXk 0..2 arrays with every element equal to some element at offset (-1,-1) (-1,0) (-1,1) (0,-1) (0,1) (1,-1) or (1,0) both plus 1 mod 3 and minus 1 mod 3, with new values introduced in order 0..2.at n=34A277788
• Number of (undirected) Hamiltonian paths in the n-dipyramidal graph.at n=12A307939
• Number of nX3 0..1 arrays with every element unequal to 2 or 3 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=24A317736