14570

Properties

Appears in sequences

• Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations.at n=14A052370
• Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations.at n=22A052370
• Numbers which have more different digits than their cubes.at n=2A061374
• Column 5 of triangle A091602.at n=42A091608
• Floor of area of triangle with consecutive prime sides.at n=40A096377
• Numbers k such that (2*k)!/(2*(k!)^2)+1 is prime.at n=42A112863
• Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/3)).at n=42A114711
• Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)).at n=44A132883
• 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), (0, 1, -1), (0, 1, 0), (1, 0, 0), (1, 0, 1)}.at n=7A151074
• Number of cubic equations ax^3 + bx^2 + cx + d = 0 with integer coefficients |a|,|b|,|c|,|d| <= n, a <> 0, having three real roots, of which at least two are equal.at n=43A155192
• Sum_{j=k(n)..prime(n)} j where k is the n-th nonprime nonnegative integer.at n=40A161669
• Number of n X n symmetric binary matrices with each 1 adjacent to no more than 2 horizontally or vertically neighboring 1s.at n=4A191507
• Number of n-bead necklaces of 5 colors allowing reversal, with no adjacent beads having the same color.at n=8A208541
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 481", based on the 5-celled von Neumann neighborhood.at n=26A272457
• Number of binary heaps on [n] that give a heap when the first element is removed.at n=11A273754
• Numbers k such that (11*10^k - 137)/9 is prime.at n=17A293687
• Solution of the complementary equation a(n) = 2*a(n-1) - a(n-2) + b(n-1) -1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=41A294867
• Solution of the complementary equation a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4) + b(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4, b(0) = 5, b(1) = 6, b(2) = 7, b(3) = 8, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295620
• On a spirally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped.at n=4A323469
• Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates.at n=6A323749