23800

Appears in sequences

• Number of planar partitions of n, but partitions that are mirror images of each other (when regarded as 3-D objects) are counted only once.at n=18A048140
• a(n) in base 13 is a repdigit.at n=46A048337
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=1, r=5, I={0,4}.at n=27A079964
• Numbers that have exactly seven prime factors counted with multiplicity (A046308) whose digit reversal is different and also has 7 prime factors (with multiplicity).at n=8A109027
• 7 times octagonal numbers: a(n) = 7*n*(3*n-2).at n=34A153797
• E.g.f. A(x) = F(x)^2 where F(x) is the e.g.f. of A179421.at n=5A179423
• Number of (w,x,y,z) with all terms in {1,...,n} and w+|x-y|<=|x-z|+|y-z|.at n=35A212691
• T(n,k)=Number of length n+4 0..k arrays with no disjoint pairs in any consecutive five terms having the same sum.at n=28A247404
• Number of length 1+4 0..n arrays with no disjoint pairs in any consecutive five terms having the same sum.at n=7A247405
• Numbers n such that n^2 is a sum of 2 and also of 4 consecutive primes.at n=22A252066
• Number of (n+1) X (3+1) 0..1 arrays with every 2 X 2 subblock diagonal minimum minus antidiagonal minimum nondecreasing horizontally and diagonal maximum minus antidiagonal maximum nondecreasing vertically.at n=8A253226
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood.at n=28A285839
• Number of nonisomorphic proper colorings of partition star graph using five colors.at n=47A297569
• Number of maximal matchings in the n X n fiveleaper graph.at n=5A308309
• Triangular array read by rows: row n shows the coefficients of this polynomial of degree n: p(x,n) = 2^(n-1) ((x+r)^n - (x+s)^n)/(r - s), where r = 2 and s = 1/2.at n=24A327317
• Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes with k simplical vertices, 0 <= k <= n.at n=48A367145
• Triangle read by rows: T(n, k) = binomial(n, k)*binomial(2*n+k, k), 0 <= k <= n.at n=31A370258
• Integers k such that k = Sum k/(p_i + j), where p_i are the prime factors of k (with multiplicity). Case j = 3.at n=9A380924