20317

Appears in sequences

• Glaisher's G numbers.at n=4A002111
• a(n) = Sum_{k=0..n-1} 3^k*B(k)*C(n,k) where B(k) is the k-th Bernoulli number and C(n,k)=binomial(n,k).at n=11A083007
• Expansion of (1+4x-6x^2-36x^3)/(1-19x^2+90x^4).at n=8A097112
• 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, -1), (-1, -1, 1), (-1, 1, -1), (-1, 1, 1), (1, 0, 0)}.at n=11A148068
• Numerator of Bernoulli(n, 1/3).at n=11A157799
• Number of (n+3) X 5 0..1 matrices with each 4 X 4 subblock idempotent.at n=16A224562
• Number of partitions p of n such that mean(p) = multiplicity(min(p)).at n=60A240205
• a(n) is the smallest nonnegative k such that there is no 3 X 3 matrix with entries in {1,...,n} whose determinant is k.at n=23A262719
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 289", based on the 5-celled von Neumann neighborhood.at n=32A271127
• Number of forests of exactly n (unlabeled) ordered rooted trees with a total of 2n non-root nodes.at n=8A292668
• Prime time numbers on 6-digit clocks: numbers of the form HMMSS where H, MM, SS are primes, H < 24, MM and SS < 60.at n=23A295014
• Numbers n such that there is precisely 1 group of order n, 2 of order n + 1 and 3 of order n + 2.at n=12A296024
• Triangle read by rows T(n, k) = Sum_{h>=0} Bernoulli(h)*binomial(n, h)*Stirling2(n-h, k)*k^h for n>=1 and 1<=k<=n.at n=57A339208