23160

Appears in sequences

• Number of partitions of 2n with all subsums different from n.at n=26A006827
• Numbers k such that phi(k) = bigomega(k)*tau(k)^2.at n=29A068540
• First differences of A069474, successive differences of (n+1)^6-n^6.at n=6A069475
• Triangle T(n,k) read by rows, where o.g.f. for T(n,k) is n!*Sum_{k=0..n} (1+x)^(n-k)/k!.at n=24A073474
• Least number beginning with n such that every partial sum is a square.at n=22A095158
• Number of irregular primes less than or equal to the 3^n-th prime.at n=9A105467
• a(n) = smallest positive multiple of n that, when represented in binary, contains the binary representations of all positive integers <= n at least once each.at n=14A144144
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (0, -1, 1), (0, 1, 1), (1, 1, -1)}.at n=9A148893
• Numbers in A075728 which are not one less than some prime.at n=26A179232
• Number of closed paths of length n whose steps are 12th roots of unity, U_12(n).at n=6A198808
• The number of functions f:{1,2,...,n}->{1,2,...,n} (endofunctions) such that all of the fixed points in f are isolated.at n=6A204042
• Square array read by antidiagonals downwards: T(k,n) = sum of the site-perimeters of words of length n >= 1 over an alphabet of size k >= 1.at n=41A292767
• Numbers k such that A348215(k) = k.at n=37A348216
• a(n) = 2^(n - 3) - A368279(n) for n >= 5, otherwise 0. Number of compositions of n whose first and last part is not equal to 1 and whose first part is not the largest part.at n=18A369584
• Triangle read by rows: T(n, k) = n! * 2^k * hypergeom([-k], [-n], 1/2).at n=30A374428