21588

Appears in sequences

• Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=20A050789
• Numbers n such that 207*2^n-1 is prime.at n=23A050855
• a(n) is the number of distinct (modulo geometric D3-operations) nonsymmetric (no reflective nor rotational symmetry) patterns which can be formed by an equilateral triangular arrangement of closely packed black and white cells satisfying the local matching rule of Pascal's triangle modulo 2, where n is the number of cells in each edge of the arrangement. The matching rule is such that any elementary top-down triangle of three neighboring cells in the arrangement contains either one or three white cells.at n=16A060552
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,37.at n=3A064255
• Number of permutations of length n which avoid the patterns 1234, 3421, 4312.at n=32A116756
• a(n) = 441*n^2 - 21.at n=6A145678
• Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=48A146766
• Triangle read by rows: expansion of p(x,n)=If[n == 0, 1, (x + 1)^n + 2^(n - 2)*Sum[Binomial[n, m]*x^m*(1 + x^(n - 2*m)), {m, 1, n - 1}]].at n=51A146766
• a(n) = 49*n^2 - n.at n=20A157923
• Number of 0..n arrays x(0..5) of 6 elements with zero 5th difference.at n=10A200157
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=47A208688
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 0 1 vertically.at n=7A208689
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 1 and 1 1 0 vertically.at n=47A208840
• Number of (w,x,y,z) with all terms in {1,...,n} and w<|x-y|+|y-z|.at n=14A212568
• Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|<|x-y|+|y-z|.at n=13A212571
• Number of length 3 1..(n+1) arrays with every leading partial sum divisible by 2, 3 or 5.at n=36A254830
• Numbers k such that k is the average of four consecutive primes k-11, k-1, k+1 and k+11.at n=21A259025
• Number of partitions of n having no even singletons.at n=46A265254
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood.at n=14A279150
• Sum of the even parts of the partitions of n into 8 parts.at n=34A309632