23475

Appears in sequences

• Number of identity bracelets of n beads of 5 colors.at n=7A032242
• Triangle T(n,d) (listed row-wise: T(1,1)=1, T(2,1)=1, T(2,2)=1, T(3,1)=2, T(3,2)=0, T(3,3)=1, ...) giving the number of n-edge general plane trees with root degree d that are fixed by the three-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).at n=80A079219
• Number of irregular primes less than or equal to the m-th prime, where m = floor(exp(n)).at n=10A105466
• Binomial transform of [1, 2, 3, 4, 0, 0, 0, ...].at n=33A139488
• Composites that are the sum of two, three, four and five consecutive composite numbers.at n=26A151745
• Number of partitions of n with no part equal to 1 or 3.at n=55A181531
• Number of (w,x,y,z) with all terms in {1,...,n} and w*x-y*z<=n.at n=14A212109
• Smallest k such that q=2*k*prime(n)^4+b , r=2*k*q^4+c , s=2*k*r^4+d and q, r and s are all prime numbers with b, c and d = -1 or 1.at n=17A225056
• Number of balanced ternary words of length n.at n=28A260938
• Magic sums of 3 X 3 semimagic squares composed of odd squares.at n=8A269297
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 181", based on the 5-celled von Neumann neighborhood.at n=32A270628
• G.f. A(x) satisfies: A(x)^2 = A( x^2 + 2*A(x)^3 ), with A(0)=0, A'(0)=1.at n=8A271959
• The number of non-equivalent distinguishing colorings of the cycle on n vertices with at most k colors (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle and the columns are indexed by k, the number of permissible colors.at n=73A309528
• Triangle read by rows: T(n,k) is the number of planar tanglegrams of size n with 0 <= k < n leaf-matched pairs. A leaf matched pair is a pair of non-leaf vertices (u,v) in the tanglegram such that the induced subtrees rooted and u and v also form a tanglegram (equivalently, the leaves in these two subtrees are matched by the matching that forms the original tanglegram).at n=30A349409
• On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=48A352730