23805

Appears in sequences

• Number of inequivalent ways to color vertices of a regular tetrahedron using <= n colors.at n=23A006008
• a(n) = (2*n - 1)*n^2.at n=23A015237
• Numbers k such that 7^k == -1 (mod k-1).at n=15A055690
• Numbers k such that the sets of prime factors (ignoring multiplicity) of A000203(k) = sigma(k) and of A001157(k) = sigma_2(k) are identical.at n=4A081380
• Square table, read by antidiagonals, where the g.f. for row n+1 is generated by: x*R_{n+1}(x) = (1+n*x - 1/R_n(x))/(n+1) with R_0(x) = Sum_{n>=0} n!*x^n.at n=51A111528
• Row 3 of table A111528.at n=6A111530
• Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+3 of T), or [T^p](m,0) = p*T(p+m,p+3) for all m>=1 and p>=-3.at n=21A111544
• Triangular matrix T, read by rows, that satisfies: SHIFT_LEFT(column 0 of T^p) = p*(column p+3 of T), or [T^p](m,0) = p*T(p+m,p+3) for all m>=1 and p>=-3.at n=49A111544
• Row sums of A128623.at n=44A128624
• Integer averages of the first perfect cubes up to some n^3.at n=33A164577
• Row sums of the triangle in A199332.at n=44A199771
• Number of 0..n arrays x(0..2) of 3 elements with each no smaller than the sum of its previous elements modulo (n+1).at n=43A200252
• Number of (w,x,y,z) with all terms in {0,...,n}, w even, and x = y + z.at n=44A212760
• Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=2A264253
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=17A264257
• Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=3A264259
• Number of 2 X 2 matrices having all elements in {-n,..,0,..,n} with determinant = permanent.at n=11A280059
• a(n) = ((p-1)^3 - (p-1)^2)/4 where p is the n-th prime.at n=14A331764
• Number of 2 X 2 matrices over Z_n whose permanent equals their determinant.at n=22A345754
• Number of graph minors in the n-dipyramidal graph.at n=4A353599